Add direction change level order #827
Open
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
* Fix problems with testing equality to None. * Removed unused variable
* Added function to calculate sum of all sub-squares in a square matrix * Added test for sum_sub_squares function * Updated README
* Add two more breaking bad tests * move tests to test_bracket
* adds matrix inversion for n x n matrices * adds link in readme and edge cases in file * fixes typo
Added Find Total Number of Connected Component in Graph
Remove temporary variable
Small fix on the test description to match the code
code implemented for Prim's Algorithm to find minimum spanning tree. Although there was file named minimum_spanning_tree.py in graph section but contain only Kruskal Algorithm . Prim's Algo. was still missing
function and sample test cases added
function created
unittest added for prims_minimum_spanning.py
function name changed
link added for new file prims_minimum_spanning.py
Create prims_minimum_spanning.py
fix import prism_minimum_spanning import
Added the basic description of Fibonacci Numbers and the main aim of the functions.
* add_integer_divide * add_integer_divide * add_integer_divide * add_integer_divide * README updated * Manacher's algorithm * Manacher's algorithm * add Manacher's algorithm * with more snack test case * more snack cases for testing files * change the name of function `longestPalindrome` to `longest_palindrome` * test changed because the name of function changed
finding number of digits using logs created with unit tests
add ternary search
* feat:(first draft for the misra gries algorithm) keon#1 * feat:(Added examples and changed to correct name) keon#1 * feat:(Added init file for testing) keon#2 * test:(Added tests for misras_gries function) keon#2 * feat:(add 1-sparse recovery algorithm) keon#7 * Add finalized 1-sparse-recovery algorithm * Renamed sparse function name to work with import * Tests added for 1-sparse-recovery function * Tests added for 1-sparse-recovery function Co-authored-by: callmeGoldenboy <natanteferi@gmail.com>
* feat:(first draft for the misra gries algorithm) keon#1 * feat:(Added examples and changed to correct name) keon#1 * feat:(Added init file for testing) keon#2 * test:(Added tests for misras_gries function) keon#2 * add misra-gries reference * add correct reference to misra_gries * add misra_gries import Co-authored-by: Anders Renström <anders.renstroom@gmail.com> Co-authored-by: Keon <kwk236@gmail.com>
* feat: Add basic ch. remainder theorem algorithm * feat: Add all n coprime check Co-authored-by: Lazar Cerovic<lazarc@kth.se> * Add gcd function * Add list length > 0 check * doc: Improve function documentation * feat: add all divisors need to be > 1 * test: Add test cases for crt solver * fix: make check_coprime private * fix: Change to python3.7 type hints * refactor: Move ch. remainder theorem tests to test_maths * Add link in README * Remove unnecessary whitespace and add newline at end of file * docs: Fix README alphabetic order
* fix_rotate.py The way it was, you couldn't pass in a rotation higher than the length of the string doubled without getting a blank string in return. This way allows you to pass in any positive integer and get a result. Also, The last line of the description said that it took 2 strings and returned a boolean. This is not correct. The first line of the comment is correct. * Update rotate.py After submitting my last change, I realized it would have been better to not keep concatenating the string. * Updated Comments rotate.py
* Corrected spelling anf grammar errors in docstring for heap. * Fixed method signature for remove_min by removing unused parameter i. * Fixed grammar in min_child docstring.
* Corrected spelling anf grammar errors in docstring for heap. * Fixed method signature for remove_min by removing unused parameter i. * Fixed grammar in min_child docstring. * Fixed spelling error. * Fixed spelling errors in matrix_exponentiation.py * Removed trailing semicolons in matrix_inversion.py. TODO: Check for possible type error in line 61. * Fixed spelling error in base_conversion.py. * Fixed incorrect reference in min_height.py * Fixed incorrect reference in max_height.py
* Update longest_palindromic_subsequence.py * Update __init__.py * Update test_map.py
* Add tests for rotate.py * Add another implementation
* Add method using deque * updated tests for is_palindrome.py deque
Adds a missing import for the test of rotate_alt
3 Times Faster Response
Increase performance of Function
Bugfix: Add missing import for rotate_alt test
* add_exchange_sort
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Change Direction LvlOrder.txt
This is a level Order Traversal of A tree But with the posibility of changing the Direction of it between The amount of levels Someone Wants. In the code the direction will change every 2 levels(form left to right and viceversa), But it can be changed by modifying the value of variable count