|
12 | 12 | * [Combination Sum](backtracking/combination_sum.py) |
13 | 13 | * [Crossword Puzzle Solver](backtracking/crossword_puzzle_solver.py) |
14 | 14 | * [Generate Parentheses](backtracking/generate_parentheses.py) |
| 15 | + * [Generate Parentheses Iterative](backtracking/generate_parentheses_iterative.py) |
15 | 16 | * [Hamiltonian Cycle](backtracking/hamiltonian_cycle.py) |
16 | 17 | * [Knight Tour](backtracking/knight_tour.py) |
17 | 18 | * [Match Word Pattern](backtracking/match_word_pattern.py) |
|
174 | 175 |
|
175 | 176 | ## Data Compression |
176 | 177 | * [Burrows Wheeler](data_compression/burrows_wheeler.py) |
| 178 | + * [Coordinate Compression](data_compression/coordinate_compression.py) |
177 | 179 | * [Huffman](data_compression/huffman.py) |
178 | 180 | * [Lempel Ziv](data_compression/lempel_ziv.py) |
179 | 181 | * [Lempel Ziv Decompress](data_compression/lempel_ziv_decompress.py) |
|
193 | 195 | * [Permutations](data_structures/arrays/permutations.py) |
194 | 196 | * [Prefix Sum](data_structures/arrays/prefix_sum.py) |
195 | 197 | * [Product Sum](data_structures/arrays/product_sum.py) |
| 198 | + * [Rotate Array](data_structures/arrays/rotate_array.py) |
196 | 199 | * [Sparse Table](data_structures/arrays/sparse_table.py) |
197 | 200 | * [Sudoku Solver](data_structures/arrays/sudoku_solver.py) |
198 | 201 | * Binary Tree |
|
395 | 398 | * [Minimum Squares To Represent A Number](dynamic_programming/minimum_squares_to_represent_a_number.py) |
396 | 399 | * [Minimum Steps To One](dynamic_programming/minimum_steps_to_one.py) |
397 | 400 | * [Minimum Tickets Cost](dynamic_programming/minimum_tickets_cost.py) |
| 401 | + * [Narcissistic Number](dynamic_programming/narcissistic_number.py) |
398 | 402 | * [Optimal Binary Search Tree](dynamic_programming/optimal_binary_search_tree.py) |
399 | 403 | * [Palindrome Partitioning](dynamic_programming/palindrome_partitioning.py) |
400 | 404 | * [Range Sum Query](dynamic_programming/range_sum_query.py) |
|
465 | 469 |
|
466 | 470 | ## Geometry |
467 | 471 | * [Geometry](geometry/geometry.py) |
| 472 | + * [Graham Scan](geometry/graham_scan.py) |
| 473 | + * [Jarvis March](geometry/jarvis_march.py) |
| 474 | + * Tests |
| 475 | + * [Test Graham Scan](geometry/tests/test_graham_scan.py) |
| 476 | + * [Test Jarvis March](geometry/tests/test_jarvis_march.py) |
468 | 477 |
|
469 | 478 | ## Graphics |
470 | 479 | * [Bezier Curve](graphics/bezier_curve.py) |
|
621 | 630 | * [Sequential Minimum Optimization](machine_learning/sequential_minimum_optimization.py) |
622 | 631 | * [Similarity Search](machine_learning/similarity_search.py) |
623 | 632 | * [Support Vector Machines](machine_learning/support_vector_machines.py) |
| 633 | + * [T Stochastic Neighbour Embedding](machine_learning/t_stochastic_neighbour_embedding.py) |
624 | 634 | * [Word Frequency Functions](machine_learning/word_frequency_functions.py) |
625 | 635 | * [Xgboost Classifier](machine_learning/xgboost_classifier.py) |
626 | 636 | * [Xgboost Regressor](machine_learning/xgboost_regressor.py) |
|
723 | 733 | * [Secant Method](maths/numerical_analysis/secant_method.py) |
724 | 734 | * [Simpson Rule](maths/numerical_analysis/simpson_rule.py) |
725 | 735 | * [Square Root](maths/numerical_analysis/square_root.py) |
| 736 | + * [Weierstrass Method](maths/numerical_analysis/weierstrass_method.py) |
726 | 737 | * [Odd Sieve](maths/odd_sieve.py) |
727 | 738 | * [Perfect Cube](maths/perfect_cube.py) |
728 | 739 | * [Perfect Number](maths/perfect_number.py) |
|
875 | 886 | * [Quine](other/quine.py) |
876 | 887 | * [Scoring Algorithm](other/scoring_algorithm.py) |
877 | 888 | * [Sdes](other/sdes.py) |
| 889 | + * [Sliding Window Maximum](other/sliding_window_maximum.py) |
878 | 890 | * [Tower Of Hanoi](other/tower_of_hanoi.py) |
879 | 891 | * [Word Search](other/word_search.py) |
880 | 892 |
|
|
956 | 968 | * [Sol1](project_euler/problem_009/sol1.py) |
957 | 969 | * [Sol2](project_euler/problem_009/sol2.py) |
958 | 970 | * [Sol3](project_euler/problem_009/sol3.py) |
| 971 | + * [Sol4](project_euler/problem_009/sol4.py) |
959 | 972 | * Problem 010 |
960 | 973 | * [Sol1](project_euler/problem_010/sol1.py) |
961 | 974 | * [Sol2](project_euler/problem_010/sol2.py) |
|
973 | 986 | * [Sol2](project_euler/problem_014/sol2.py) |
974 | 987 | * Problem 015 |
975 | 988 | * [Sol1](project_euler/problem_015/sol1.py) |
| 989 | + * [Sol2](project_euler/problem_015/sol2.py) |
976 | 990 | * Problem 016 |
977 | 991 | * [Sol1](project_euler/problem_016/sol1.py) |
978 | 992 | * [Sol2](project_euler/problem_016/sol2.py) |
|
1266 | 1280 | * [Comb Sort](sorts/comb_sort.py) |
1267 | 1281 | * [Counting Sort](sorts/counting_sort.py) |
1268 | 1282 | * [Cycle Sort](sorts/cycle_sort.py) |
| 1283 | + * [Cyclic Sort](sorts/cyclic_sort.py) |
1269 | 1284 | * [Double Sort](sorts/double_sort.py) |
1270 | 1285 | * [Dutch National Flag Sort](sorts/dutch_national_flag_sort.py) |
1271 | 1286 | * [Exchange Sort](sorts/exchange_sort.py) |
|
1296 | 1311 | * [Shell Sort](sorts/shell_sort.py) |
1297 | 1312 | * [Shrink Shell Sort](sorts/shrink_shell_sort.py) |
1298 | 1313 | * [Slowsort](sorts/slowsort.py) |
| 1314 | + * [Stalin Sort](sorts/stalin_sort.py) |
1299 | 1315 | * [Stooge Sort](sorts/stooge_sort.py) |
1300 | 1316 | * [Strand Sort](sorts/strand_sort.py) |
1301 | 1317 | * [Tim Sort](sorts/tim_sort.py) |
|
0 commit comments