* chore: add `trapped_rainwater.cpp` to DIRECTORY.md
* feat: implement Trapped Rain Water algorithm
* chore: add links to the trapped rain water problem
* chore(docs): remove Trapped Rain Water dir
* ref: add edges tests
* doc: adding Sozel as author
* doc: includes documentatino
* ref: use `unsigned int` for height of walls
* fix: use fixed-width integers instead of unsigned int
* chore: rearrange included libraries
---------
Co-authored-by: realstealthninja <68815218+realstealthninja@users.noreply.github.com>
* fix: initialise properly res, set properly size of ans
* test: add check with empty input
* style: use const reference as input type
* refactor: add ind_type
* style: use reverse interators to b
* style: use auto in definition of idx
* updating DIRECTORY.md
* style: clean-up includes
* style: use std::string::size_type in definition of ind_type
---------
Co-authored-by: github-actions[bot] <github-actions@users.noreply.github.com>
Co-authored-by: David Leal <halfpacho@gmail.com>
* Modified search/text_search.cpp
* Added tests
* Added a few test cases
* Added a few more test cases and documentation
* Minor fix
* Minor fixes
* Minor fixes
* Minor output fixes
* Minor output fixes
* Minor readability fixes
* clang-format and clang-tidy fixes for a01765a6
* Restored original settings
* clang-format and clang-tidy fixes for 6a8f3a4e
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: David Leal <halfpacho@gmail.com>
* added a new directory named Recursion and a most common exxample of recusion i.e. Tower of Hanoi in it
* Added Comments
* Bug fixed according to the correct definition of armstrong_number
* Bug Fixed in armstrong_number.cpp
Bug Fixed in armstrong_number.cpp according to the correct definition of armstrong_number.
* Update armstrong_number.cpp
* Added documentation
* Delete Recursion directory
* Update armstrong_number.cpp
* Update dynamic_programming/armstrong_number.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update armstrong_number.cpp
fixed errors.
* Apply suggestions from code review
* Apply suggestions from code review
* Apply suggestions from code review
* Apply suggestions from code review
* Apply suggestions from code review
* Apply suggestions from code review
* Update armstrong_number.cpp
Applied suggested changes.
* Update armstrong_number.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* [feat/fix/docs]: Improve the `dynamic_programming/longest_increasing_subsequence.cpp` file
* [test/feat]: Add self-test implementations and...
...namespace (`dynamic_programming`).
Thanks to @manncodes for the idea and help!
Co-authored-by: Mann Patel <manncodes@users.noreply.github.com>
* clang-format and clang-tidy fixes for 7d4562d6
Co-authored-by: Mann Patel <manncodes@users.noreply.github.com>
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
* Added Minimum Edit Distance Algorithm
* Updated the code According to the guidelines
* Updated with necessary changed and documentation
* fix: Apply suggestions from code review
* updating DIRECTORY.md
* Some more chnages according to clang-tidy
clang-tidy suggested moving all if-else statements under braces. So, I did it.
* Array changed to vector as suggested
Using of arrays changed to vectors as clang-tidy suggested to use vector instead of arrays.
* Apply suggestions from code review
Co-authored-by: David Leal <halfpacho@gmail.com>
* Updated with necessary changes
* Apply suggestions from code review
Co-authored-by: David Leal <halfpacho@gmail.com>
* Slight fixes on a comment
* Updated Necessary Changes
* Apply suggestions from code review
Co-authored-by: David Leal <halfpacho@gmail.com>
* Updated with necessary changes
* Updated with necessary changes
* Updated with changes
* Updated with changes and some tweaks
* Updated with changes
* Update dynamic_programming/minimum_edit_distance.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update dynamic_programming/minimum_edit_distance.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Updated suggested changes
Co-authored-by: David Leal <halfpacho@gmail.com>
Co-authored-by: David Leal <halfpacho@gmail.com>
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: Anup Kumar Panwar <1anuppanwar@gmail.com>
* feat: Add ncr mod p code (#1323)
* Update math/ncr_modulo_p.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Added all functions inside a class + added more asserts
* updating DIRECTORY.md
* clang-format and clang-tidy fixes for f6df24a5
* Replace int64_t to uint64_t + add namespace + detailed documentation
* clang-format and clang-tidy fixes for e09a0579
* Add extra namespace + add const& in function arguments
* clang-format and clang-tidy fixes for 8111f881
* Update ncr_modulo_p.cpp
* clang-format and clang-tidy fixes for 2ad2f721
* Update math/ncr_modulo_p.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update math/ncr_modulo_p.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update math/ncr_modulo_p.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* clang-format and clang-tidy fixes for 5b69ba5c
* updating DIRECTORY.md
* clang-format and clang-tidy fixes for a8401d4b
Co-authored-by: David Leal <halfpacho@gmail.com>
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
* palindrome no
a program to check if a number is palindrome or not
* updated palindrome.cpp
* updated palindrome.cpp
missing equal to operator at line no 16
* flatten_a_binary_seach_tree
This program flattens a binary search tree or in simple words, converts it into linked list in sorted form
* a prog to convert bst into linked list
A code that is used to convert a binary search tree into linked list
* created merge k sorted arrays
this program displays all the elements from the different arrays(sorted) into 1 single array(sorted).
* updated braces in some parts
* included braces in line no 58
* included braces in line 58 and 60
* created trap_rainwater.cpp
A program to calculate the maximum amount of water that can be stored between buildings.
* deleted rainwater harvesting
* deleted palindrome
* deleted merge k sorted arrays
* deleted binary search tree to linked list
* deleted binary search tree to linked list
* created min_coins_topdown.cpp
This is another version of coins exchange problem solved using top down approach
* updated the code
please take a look at it
* final changes
* updated my code
* updating DIRECTORY.md
* changed int64_t to int8_t and int16_t
* edited line 3
* changed line 3
* edited line 3 & removed line 18
* added extra space
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
