* Refactor lowest comomon ancestor.

* Fix linter warnings.

* Address comments and linter warnings.

* Added Kaprekar number implementation

* updating DIRECTORY.md

* Added Collatz Conjecture implementation

* updating DIRECTORY.md

* Added Ugly Numbers implementation

* updating DIRECTORY.md

* Add lowest common ancestor to the graph namespace.

* updating DIRECTORY.md

* static tests function

* Revert ugly number kaprekar and collatz.
Co-authored-by: NDeepak Vijay Agrawal <64848982+DebugAgrawal@users.noreply.github.com>
Co-authored-by: Ngithub-actions <${GITHUB_ACTOR}@users.noreply.github.com>

[fix/docs]: Improve backtracking/n_queens.cpp

* exclude 'build' directory from doxygen

* bump openmp version to 3.0

OpenMP >= v3.0 supports signed and unsigned for loop variables

(cherry picked from commit b23e9e643978de99cb17843d7388f15246e390f0)

fix: linter for prim.

* Refactor BFS algorithm.

* Rename bfs.

* Align the parameter padding.

* Fix parameter padding

* Fix typo in function name.

* [fix/docs]: Update backtracking/graph_coloring.cpp

* Add CMakeLists.txt in backtracking folder

* Add backtracking to CMakeLists.txt

* fix: Fix build issues

* docs: Various documentation fixes

* fix: minimax.cpp issues

* fix: sudoku_solve.cpp fixes

* formatting source-code for 8ffbbb35cecc5fb3dac33957e14e9da50cff9469

* make he code neat and clean without global variables

* fix 2 stars in comment

* fix MSVC errors by forcing template parameter in function calls

Note: This is identical to passing it as a function parameter, and may not be helpful

* Update minimax.cpp

* docs: minimax.cpp improvements

* docs: Add Wikipedia link in minimax.cpp

* fix: minimax.cpp vector fix

* docs: fix Wikipedia link in minimax.cpp

* docs: fix return statement in minimax.cpp

* fix: sudoku_solve.cpp fixes

* fix: more sudoku_solve.cpp fixes

* fix: sudoku_solve.cpp fixes

* fix: sudoku_solve.cpp

* formatting source-code for 13b5b9b829eecc242746f6f00d54c35dad6c026a

* docs: update graph_coloring.cpp description

* fix: use array instead of vector (minimax.cpp)

* feat: add namespace (minimax.cpp)

* docs: update namespace description (graph_coloring.cpp)

* fix: graph_coloring.cpp

* fix: sudoku_solve.cpp fixes

* fix: graph_coloring.cpp

* fix: minimax.cpp

* fix: more sudoku_solve.cpp fixes

* fix: more graph_coloring.cpp fixes

* fix: graph_coloring.cpp fixes

* fix: sudoku_solve.cpp fixes

* fix: minimax.cpp

* fix: sudoku_solve.cpp fixes

* fix: too few template arguments (std::array)

* fix: too few template arguments (std::array, minimax.cpp)

* fix: narrowing conversion from double to int (minimax.cpp)

* fix: excess elements in struct initializer (graph_coloring.cpp)

* fix: no matching function (graph_coloring.cpp)

* fix: graph_coloring.cpp issues/errors

* fix: knight_tour.cpp issues/errors

* fix: sudoku_solve.cpp issues/errors

* [fix/docs]: Various fixes in graph_coloring.cpp

* fix: More graph_coloring.cpp fixes

* docs: Add initial comment block (sudoku_solve.cpp)

* fix: Add return statement (knight_tour.cpp)

* fix: array fixes (graph_coloring.cpp)

* docs: documentation improvements (sudoku_solve.cpp)

* docs: documentation improvements (knight_tour.cpp)

* docs: documentation improvements (sudoku_solve.cpp)

* docs: documentation improvements (graph_coloring.cpp)

* docs: Documentation improvements (graph_coloring.cpp)

Thanks, @kvedala!

* docs: Documentation improvements (sudoku_solve.cpp)

* docs: Document function parameter (sudoku_solve.cpp)

* docs: Documentation improvements (knight_tour.cpp)

* docs: Add long description (graph_coloring.cpp)

* docs: Add long description (minimax.cpp)

* docs: Add long description (sudoku_solve.cpp)

* docs: Documentation improvements (knight_tour.cpp)

* docs: Documentation improvements (sudoku_solve.cpp)

* docs: Documentation improvements (minimax.cpp)

* docs: More documentation improvements (minimax.cpp)

* docs: Documentation improvements (sudoku_solve.cpp)

* fix: sudoku_solve.cpp improvements
Co-authored-by: Ngithub-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: NKrishna Vedala <7001608+kvedala@users.noreply.github.com>

Approving for now to enable a PR that adds graph folder to the CI build system.

* Fix linter warnings for bridge finding algorithm.

* Comment main function.

[enhancement] add `Hashing` folder to cmake

* hamilton cycle dynamic programming solution in O(2^n*n) time and memory for n <= 20(n is number of vertices)

* tests added in hamilton-cycle

* stylistical fixes

* endline added

* assert for tests added

* some more fixes delete replaced with delete[] and comment extended od main function

* comments added like about author

* file descriptions added in hamiltons-cycle.cpp

* fix code per standards

* fix filename per repo standards

* code optimized

* updating DIRECTORY.md

* fixes: docs + optimization

* fix pre

* update main function docs

* move file from dynamic_programming to more appropriate graph

* updating DIRECTORY.md

* fix filename

* updating DIRECTORY.md
Co-authored-by: Nvakhokoto <v.kotoreishvili@gmail.com>
Co-authored-by: Ngithub-actions <${GITHUB_ACTOR}@users.noreply.github.com>

* fix, test: simplification and tests for number_of_positive_divisors

* Further refactor and documentation of number_of_positive_divisors

* Update the comments.

* Update the LaTeX documentation.