|
22 | 22 | * [Rat In Maze](backtracking/rat_in_maze.py)
|
23 | 23 | * [Sudoku](backtracking/sudoku.py)
|
24 | 24 | * [Sum Of Subsets](backtracking/sum_of_subsets.py)
|
| 25 | + * [Word Break](backtracking/word_break.py) |
| 26 | + * [Word Ladder](backtracking/word_ladder.py) |
25 | 27 | * [Word Search](backtracking/word_search.py)
|
26 | 28 |
|
27 | 29 | ## Bit Manipulation
|
|
98 | 100 | * [Elgamal Key Generator](ciphers/elgamal_key_generator.py)
|
99 | 101 | * [Enigma Machine2](ciphers/enigma_machine2.py)
|
100 | 102 | * [Fractionated Morse Cipher](ciphers/fractionated_morse_cipher.py)
|
| 103 | + * [Gronsfeld Cipher](ciphers/gronsfeld_cipher.py) |
101 | 104 | * [Hill Cipher](ciphers/hill_cipher.py)
|
102 | 105 | * [Mixed Keyword Cypher](ciphers/mixed_keyword_cypher.py)
|
103 | 106 | * [Mono Alphabetic Ciphers](ciphers/mono_alphabetic_ciphers.py)
|
|
210 | 213 | * [Lazy Segment Tree](data_structures/binary_tree/lazy_segment_tree.py)
|
211 | 214 | * [Lowest Common Ancestor](data_structures/binary_tree/lowest_common_ancestor.py)
|
212 | 215 | * [Maximum Fenwick Tree](data_structures/binary_tree/maximum_fenwick_tree.py)
|
| 216 | + * [Maximum Sum Bst](data_structures/binary_tree/maximum_sum_bst.py) |
213 | 217 | * [Merge Two Binary Trees](data_structures/binary_tree/merge_two_binary_trees.py)
|
214 | 218 | * [Mirror Binary Tree](data_structures/binary_tree/mirror_binary_tree.py)
|
215 | 219 | * [Non Recursive Segment Tree](data_structures/binary_tree/non_recursive_segment_tree.py)
|
|
243 | 247 | * [Min Heap](data_structures/heap/min_heap.py)
|
244 | 248 | * [Randomized Heap](data_structures/heap/randomized_heap.py)
|
245 | 249 | * [Skew Heap](data_structures/heap/skew_heap.py)
|
| 250 | + * Kd Tree |
| 251 | + * [Build Kdtree](data_structures/kd_tree/build_kdtree.py) |
| 252 | + * Example |
| 253 | + * [Example Usage](data_structures/kd_tree/example/example_usage.py) |
| 254 | + * [Hypercube Points](data_structures/kd_tree/example/hypercube_points.py) |
| 255 | + * [Kd Node](data_structures/kd_tree/kd_node.py) |
| 256 | + * [Nearest Neighbour Search](data_structures/kd_tree/nearest_neighbour_search.py) |
| 257 | + * Tests |
| 258 | + * [Test Kdtree](data_structures/kd_tree/tests/test_kdtree.py) |
246 | 259 | * Linked List
|
247 | 260 | * [Circular Linked List](data_structures/linked_list/circular_linked_list.py)
|
248 | 261 | * [Deque Doubly](data_structures/linked_list/deque_doubly.py)
|
|
274 | 287 | * [Dijkstras Two Stack Algorithm](data_structures/stacks/dijkstras_two_stack_algorithm.py)
|
275 | 288 | * [Infix To Postfix Conversion](data_structures/stacks/infix_to_postfix_conversion.py)
|
276 | 289 | * [Infix To Prefix Conversion](data_structures/stacks/infix_to_prefix_conversion.py)
|
| 290 | + * [Lexicographical Numbers](data_structures/stacks/lexicographical_numbers.py) |
277 | 291 | * [Next Greater Element](data_structures/stacks/next_greater_element.py)
|
278 | 292 | * [Postfix Evaluation](data_structures/stacks/postfix_evaluation.py)
|
279 | 293 | * [Prefix Evaluation](data_structures/stacks/prefix_evaluation.py)
|
|
282 | 296 | * [Stack With Doubly Linked List](data_structures/stacks/stack_with_doubly_linked_list.py)
|
283 | 297 | * [Stack With Singly Linked List](data_structures/stacks/stack_with_singly_linked_list.py)
|
284 | 298 | * [Stock Span Problem](data_structures/stacks/stock_span_problem.py)
|
| 299 | + * Suffix Tree |
| 300 | + * Example |
| 301 | + * [Example Usage](data_structures/suffix_tree/example/example_usage.py) |
| 302 | + * [Suffix Tree](data_structures/suffix_tree/suffix_tree.py) |
| 303 | + * [Suffix Tree Node](data_structures/suffix_tree/suffix_tree_node.py) |
| 304 | + * Tests |
| 305 | + * [Test Suffix Tree](data_structures/suffix_tree/tests/test_suffix_tree.py) |
285 | 306 | * Trie
|
286 | 307 | * [Radix Tree](data_structures/trie/radix_tree.py)
|
287 | 308 | * [Trie](data_structures/trie/trie.py)
|
|
330 | 351 | * [Power](divide_and_conquer/power.py)
|
331 | 352 | * [Strassen Matrix Multiplication](divide_and_conquer/strassen_matrix_multiplication.py)
|
332 | 353 |
|
| 354 | +## Docs |
| 355 | + * [Conf](docs/conf.py) |
| 356 | + |
333 | 357 | ## Dynamic Programming
|
334 | 358 | * [Abbreviation](dynamic_programming/abbreviation.py)
|
335 | 359 | * [All Construct](dynamic_programming/all_construct.py)
|
|
540 | 564 | * [Lu Decomposition](linear_algebra/lu_decomposition.py)
|
541 | 565 | * Src
|
542 | 566 | * [Conjugate Gradient](linear_algebra/src/conjugate_gradient.py)
|
543 |
| - * Gaussian Elimination Pivoting |
544 |
| - * [Gaussian Elimination Pivoting](linear_algebra/src/gaussian_elimination_pivoting/gaussian_elimination_pivoting.py) |
| 567 | + * [Gaussian Elimination Pivoting](linear_algebra/src/gaussian_elimination_pivoting.py) |
545 | 568 | * [Lib](linear_algebra/src/lib.py)
|
546 | 569 | * [Polynom For Points](linear_algebra/src/polynom_for_points.py)
|
547 | 570 | * [Power Iteration](linear_algebra/src/power_iteration.py)
|
|
661 | 684 | * [Manhattan Distance](maths/manhattan_distance.py)
|
662 | 685 | * [Matrix Exponentiation](maths/matrix_exponentiation.py)
|
663 | 686 | * [Max Sum Sliding Window](maths/max_sum_sliding_window.py)
|
664 |
| - * [Median Of Two Arrays](maths/median_of_two_arrays.py) |
665 | 687 | * [Minkowski Distance](maths/minkowski_distance.py)
|
666 | 688 | * [Mobius Function](maths/mobius_function.py)
|
667 | 689 | * [Modular Division](maths/modular_division.py)
|
|
772 | 794 | * [Cramers Rule 2X2](matrix/cramers_rule_2x2.py)
|
773 | 795 | * [Inverse Of Matrix](matrix/inverse_of_matrix.py)
|
774 | 796 | * [Largest Square Area In Matrix](matrix/largest_square_area_in_matrix.py)
|
| 797 | + * [Matrix Based Game](matrix/matrix_based_game.py) |
775 | 798 | * [Matrix Class](matrix/matrix_class.py)
|
776 | 799 | * [Matrix Equalization](matrix/matrix_equalization.py)
|
777 | 800 | * [Matrix Multiplication Recursion](matrix/matrix_multiplication_recursion.py)
|
|
864 | 887 | * [Newtons Second Law Of Motion](physics/newtons_second_law_of_motion.py)
|
865 | 888 | * [Photoelectric Effect](physics/photoelectric_effect.py)
|
866 | 889 | * [Potential Energy](physics/potential_energy.py)
|
| 890 | + * [Rainfall Intensity](physics/rainfall_intensity.py) |
867 | 891 | * [Reynolds Number](physics/reynolds_number.py)
|
868 | 892 | * [Rms Speed Of Molecule](physics/rms_speed_of_molecule.py)
|
869 | 893 | * [Shear Stress](physics/shear_stress.py)
|
|
1185 | 1209 | * [Binary Tree Traversal](searches/binary_tree_traversal.py)
|
1186 | 1210 | * [Double Linear Search](searches/double_linear_search.py)
|
1187 | 1211 | * [Double Linear Search Recursion](searches/double_linear_search_recursion.py)
|
| 1212 | + * [Exponential Search](searches/exponential_search.py) |
1188 | 1213 | * [Fibonacci Search](searches/fibonacci_search.py)
|
1189 | 1214 | * [Hill Climbing](searches/hill_climbing.py)
|
1190 | 1215 | * [Interpolation Search](searches/interpolation_search.py)
|
|
1260 | 1285 | * [Can String Be Rearranged As Palindrome](strings/can_string_be_rearranged_as_palindrome.py)
|
1261 | 1286 | * [Capitalize](strings/capitalize.py)
|
1262 | 1287 | * [Check Anagrams](strings/check_anagrams.py)
|
| 1288 | + * [Count Vowels](strings/count_vowels.py) |
1263 | 1289 | * [Credit Card Validator](strings/credit_card_validator.py)
|
1264 | 1290 | * [Damerau Levenshtein Distance](strings/damerau_levenshtein_distance.py)
|
1265 | 1291 | * [Detecting English Programmatically](strings/detecting_english_programmatically.py)
|
|
1327 | 1353 | * [Get Ip Geolocation](web_programming/get_ip_geolocation.py)
|
1328 | 1354 | * [Get Top Billionaires](web_programming/get_top_billionaires.py)
|
1329 | 1355 | * [Get Top Hn Posts](web_programming/get_top_hn_posts.py)
|
1330 |
| - * [Get User Tweets](web_programming/get_user_tweets.py) |
1331 | 1356 | * [Giphy](web_programming/giphy.py)
|
1332 | 1357 | * [Instagram Crawler](web_programming/instagram_crawler.py)
|
1333 | 1358 | * [Instagram Pic](web_programming/instagram_pic.py)
|
|
0 commit comments