feat: Finding no. of digits in a Number (#1497)

* Finding no. of digits in a Number

* Initialize n

* Initialize n as int

* Changes done

* Changes done with codes by adding more comments

* Changes done with codes by adding name as md

* Modified comments

* add void

* remove void & update comments

* Set some changes to pass Awesome CI Workflow

* add return 0 & file name in lower case

* Changes done..

* Update finding_number_of_Digits_in_a_Number.cpp

* Update finding_number_of_Digits_in_a_Number.cpp

* Update finding_number_of_Digits_in_a_Number.cpp

* formatting filenames 0ec45e33

* updating DIRECTORY.md

* clang-format and clang-tidy fixes for 0ec45e33

* clang-format and clang-tidy fixes for 9c0a437e

* updating DIRECTORY.md

* Wrote test, needs review

* [fix/docs]: Fix tests/code and add documentation

Co-authored-by: David Leal <halfpacho@gmail.com>
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>

sorting/dnf_sort.cpp

@@ -1,7 +1,8 @@
 /**
  * @file
  * @brief Implementation of the [DNF
- * sort](https://www.geeksforgeeks.org/sort-an-array-of-0s-1s-and-2s/) implementation
+ * sort](https://www.geeksforgeeks.org/sort-an-array-of-0s-1s-and-2s/)
+ * implementation
  * @details
  * C++ program to sort an array with 0, 1 and 2 in a single pass(DNF sort).
  * Since one traversal of the array is there hence it works in O(n) time
@@ -22,7 +23,8 @@ namespace sorting {
 /**
  * @namespace dnf_sort
  * @brief Functions for the [DNF
- * sort](https://en.wikipedia.org/wiki/Dutch_national_flag_problem) implementation
+ * sort](https://en.wikipedia.org/wiki/Dutch_national_flag_problem)
+ * implementation
  */
 namespace dnf_sort {
 /**