* Create reverse_binary_tree.cpp
* Added documentation
Added Documentation for the level_order_traversal() function, and implemented a print() function to display the tree to STDOUT
* Added documentation
* Renamed tests to test
* Fixed issue with incorrect using statement
* updating DIRECTORY.md
* clang-format and clang-tidy fixes for fb86292d
* Added Test cases
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Changed int to int64_t
* Updated documentation wording
* Added reference to intersection of two arrays
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: David Leal <halfpacho@gmail.com>
* feat: added math/area.cpp
* feat: added surface area of sphere, cube and cylinder
* docs: modified @brief
* feat: changed to template functions
* test: added 2 test cases for square_area()
* test: added 3rd test case
* [test/docs] added more test cases and docs for them
* docs: added @details
* updating DIRECTORY.md
* fix: changed from math.h to cmath
Co-authored-by: David Leal <halfpacho@gmail.com>
* feat: added algorithms to the math namespace
Co-authored-by: David Leal <halfpacho@gmail.com>
* fix: call functions from the math namespace for testing
* fix: style indentation
Co-authored-by: David Leal <halfpacho@gmail.com>
* fix: style indentation
Co-authored-by: David Leal <halfpacho@gmail.com>
* feat: uses uint16_t instead of int for testing
* docs: added comments for testing variables
* fix: style guide
Co-authored-by: David Leal <halfpacho@gmail.com>
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: David Leal <halfpacho@gmail.com>
* Add files via upload
# Class Based DSU
-Using Path Compression to get the best time complexity O(1)
-Using Union Rank to keep track of changes using parent(p) O(logN)
* Class based DSU : Path Compression O(1) and Union Rank O(logN)
* made changes to satisfy the meets of the PR
changes made to satisfy the needs of the PR
- used base lib instead of <bits/stdc++.h>
- changed all stdin's and included pre-declared test cases
* removed stdin for testing
* changed file name from upper case to lower case
* made necessary changes
* Delete DSU_union_rank.cpp
* Delete DSU_path_compresssion.cpp
* added explicit to contructors, return 0, n=dec
* Delete dsu_path_compresssion.cpp
* added documentations, to match the typical structure
Added @brief @details @author @param @returns
* Update data_structures/dsu_union_rank.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/dsu_path_compression.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/dsu_path_compression.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/dsu_path_compression.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/dsu_union_rank.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/dsu_path_compression.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/dsu_path_compression.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* added self-implementation test cases, changed int to uint64_t
* std::cout after assert
* Update data_structures/dsu_path_compression.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/dsu_union_rank.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/dsu_path_compression.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/dsu_path_compression.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/dsu_path_compression.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/dsu_path_compression.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* updating DIRECTORY.md
* clang-format and clang-tidy fixes for b8c37d09
* Update data_structures/dsu_path_compression.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/dsu_path_compression.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* documentation changes
* Update dsu_union_rank.cpp
* Update data_structures/dsu_path_compression.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/dsu_path_compression.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/dsu_union_rank.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/dsu_path_compression.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/dsu_union_rank.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/dsu_union_rank.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* clang-format and clang-tidy fixes for 18843179
* Update data_structures/dsu_path_compression.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/dsu_path_compression.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/dsu_union_rank.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* clang-format and clang-tidy fixes for 5c24d9a9
* Update data_structures/dsu_union_rank.cpp
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: Abhinn Mishra <49574460+mishraabhinn@users.noreply.github.com>
Co-authored-by: Ayaan Khan <ayaankhan98@gmail.com>
* Create reverse_binary_tree.cpp
* Added documentation
Added Documentation for the level_order_traversal() function, and implemented a print() function to display the tree to STDOUT
* Added documentation
* Renamed tests to test
* Fixed issue with incorrect using statement
* updating DIRECTORY.md
* clang-format and clang-tidy fixes for fb86292d
* Added Test cases
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Changed int to int64_t
* Updated documentation wording
* Reused code from union_of_two_arrays and modified for intersection
* Fixed bug and corrected test output
* Renamed file to better meet filename guidelines
* updating DIRECTORY.md
* clang-format and clang-tidy fixes for e653f77a
* Changed integer type from int64_t to int32_t
* Added reference to similar union_of_two_arrays file
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: David Leal <halfpacho@gmail.com>
Co-authored-by: Abhinn Mishra <49574460+mishraabhinn@users.noreply.github.com>
* Create reverse_binary_tree.cpp
* Added documentation
Added Documentation for the level_order_traversal() function, and implemented a print() function to display the tree to STDOUT
* Added documentation
* Renamed tests to test
* Fixed issue with incorrect using statement
* updating DIRECTORY.md
* clang-format and clang-tidy fixes for fb86292d
* Added Test cases
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Changed int to int64_t
* Updated documentation wording
* Rewrote array_right_rotation by modifying code from array_left_rotation
* Minor documentation changes
* clang-format and clang-tidy fixes for 16672f02
* Update operations_on_datastructures/array_right_rotation.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Changed int to size_t
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: David Leal <halfpacho@gmail.com>
* Create reverse_binary_tree.cpp
* Added documentation
Added Documentation for the level_order_traversal() function, and implemented a print() function to display the tree to STDOUT
* Added documentation
* Renamed tests to test
* Fixed issue with incorrect using statement
* updating DIRECTORY.md
* clang-format and clang-tidy fixes for fb86292d
* Added Test cases
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Changed int to int64_t
* Updated documentation wording
* Fixed wrong integer type
Changed int64_t to int32_t
* clang-format and clang-tidy fixes for 2af706b1
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: David Leal <halfpacho@gmail.com>
* updated the code to make it more efficient
* Update math/check_prime.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update math/check_prime.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Apply suggestions from code review
Co-authored-by: David Leal <halfpacho@gmail.com>
* feat: added a1z26 cipher
* updating DIRECTORY.md
* clang-format and clang-tidy fixes for 6e5b6be0
* Update ciphers/a1z26_cipher.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* clang-format and clang-tidy fixes for 36edde81
* fix: brace style
Co-authored-by: David Leal <halfpacho@gmail.com>
* [feat/fix]: uses uint8_t for maps instead of int
* clang-format and clang-tidy fixes for ef211d41
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: David Leal <halfpacho@gmail.com>
* Create reverse_binary_tree.cpp
* Added documentation
Added Documentation for the level_order_traversal() function, and implemented a print() function to display the tree to STDOUT
* Added documentation
* Renamed tests to test
* Fixed issue with incorrect using statement
* updating DIRECTORY.md
* clang-format and clang-tidy fixes for fb86292d
* Added Test cases
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Changed int to int64_t
* Updated documentation wording
* Added namespace and print function
Added the operations_on_datastructures namespace and created a function to print a vector.
* Added implementation of union for two arrays
* Fixed bug with initialization of indexes and added test case
* Added test cases
* Modified references to const &
* Renamed file to meet filename guidelines better
* updating DIRECTORY.md
* Update operations_on_datastructures/union_of_two_arrays.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/union_of_two_arrays.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/union_of_two_arrays.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Made changes to documentation
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: David Leal <halfpacho@gmail.com>
* Create reverse_binary_tree.cpp
* Added documentation
Added Documentation for the level_order_traversal() function, and implemented a print() function to display the tree to STDOUT
* Added documentation
* Renamed tests to test
* Fixed issue with incorrect using statement
* updating DIRECTORY.md
* clang-format and clang-tidy fixes for fb86292d
* Added Test cases
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Changed int to int64_t
* Updated documentation wording
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: David Leal <halfpacho@gmail.com>
* feat: add atbash_cipher
* [test/fix]: test case expected result
* docs: added comments for main and test function
* doc: changed brief for test function
Co-authored-by: David Leal <halfpacho@gmail.com>
* updating DIRECTORY.md
* doc: fixed test comment
Co-authored-by: David Leal <halfpacho@gmail.com>
* [feat/fix]: made test function static
Co-authored-by: David Leal <halfpacho@gmail.com>
* doc: added author comment
Co-authored-by: David Leal <halfpacho@gmail.com>
* fix: brace style
Co-authored-by: David Leal <halfpacho@gmail.com>
* doc: modified file description and added comments for test function
* doc: added comment for #include <iostream>
Co-authored-by: David Leal <halfpacho@gmail.com>
* doc: added description of the algorithm
* Update ciphers/atbash_cipher.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update ciphers/atbash_cipher.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update ciphers/atbash_cipher.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update ciphers/atbash_cipher.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* fix: Apply suggestions from code review
Co-authored-by: David Leal <halfpacho@gmail.com>
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
* Fixed array max length and coding style
Max length of arrays was previously an absurdly high integer, instead implemented a numerical upper bound using log2 (max depth of seg tree being logn). Removed `using namespace std;` and `typedef long long ll;` and other competitive coding practices. Added input prompts.
* Fixed remaining clang-tidy warnings
* Replaced reference parameters with const & or *
* Self-tests and documentation
* Improved documentation
* Added author names
Co-authored-by: David Leal <halfpacho@gmail.com>
