|
29 | 29 | * [Minmax](backtracking/minmax.py)
|
30 | 30 | * [N Queens](backtracking/n_queens.py)
|
31 | 31 | * [N Queens Math](backtracking/n_queens_math.py)
|
| 32 | + * [Power Sum](backtracking/power_sum.py) |
32 | 33 | * [Rat In Maze](backtracking/rat_in_maze.py)
|
33 | 34 | * [Sudoku](backtracking/sudoku.py)
|
34 | 35 | * [Sum Of Subsets](backtracking/sum_of_subsets.py)
|
|
73 | 74 | * [Game Of Life](cellular_automata/game_of_life.py)
|
74 | 75 | * [Nagel Schrekenberg](cellular_automata/nagel_schrekenberg.py)
|
75 | 76 | * [One Dimensional](cellular_automata/one_dimensional.py)
|
| 77 | + * [Wa Tor](cellular_automata/wa_tor.py) |
76 | 78 |
|
77 | 79 | ## Ciphers
|
78 | 80 | * [A1Z26](ciphers/a1z26.py)
|
|
146 | 148 | * [Decimal To Binary Recursion](conversions/decimal_to_binary_recursion.py)
|
147 | 149 | * [Decimal To Hexadecimal](conversions/decimal_to_hexadecimal.py)
|
148 | 150 | * [Decimal To Octal](conversions/decimal_to_octal.py)
|
| 151 | + * [Energy Conversions](conversions/energy_conversions.py) |
149 | 152 | * [Excel Title To Column](conversions/excel_title_to_column.py)
|
150 | 153 | * [Hex To Bin](conversions/hex_to_bin.py)
|
151 | 154 | * [Hexadecimal To Decimal](conversions/hexadecimal_to_decimal.py)
|
|
166 | 169 | * Arrays
|
167 | 170 | * [Permutations](data_structures/arrays/permutations.py)
|
168 | 171 | * [Prefix Sum](data_structures/arrays/prefix_sum.py)
|
| 172 | + * [Product Sum](data_structures/arrays/product_sum.py) |
169 | 173 | * Binary Tree
|
170 | 174 | * [Avl Tree](data_structures/binary_tree/avl_tree.py)
|
171 | 175 | * [Basic Binary Tree](data_structures/binary_tree/basic_binary_tree.py)
|
|
233 | 237 | * [Double Ended Queue](data_structures/queue/double_ended_queue.py)
|
234 | 238 | * [Linked Queue](data_structures/queue/linked_queue.py)
|
235 | 239 | * [Priority Queue Using List](data_structures/queue/priority_queue_using_list.py)
|
| 240 | + * [Queue By List](data_structures/queue/queue_by_list.py) |
236 | 241 | * [Queue By Two Stacks](data_structures/queue/queue_by_two_stacks.py)
|
237 |
| - * [Queue On List](data_structures/queue/queue_on_list.py) |
238 | 242 | * [Queue On Pseudo Stack](data_structures/queue/queue_on_pseudo_stack.py)
|
239 | 243 | * Stacks
|
240 | 244 | * [Balanced Parentheses](data_structures/stacks/balanced_parentheses.py)
|
|
290 | 294 | * [Inversions](divide_and_conquer/inversions.py)
|
291 | 295 | * [Kth Order Statistic](divide_and_conquer/kth_order_statistic.py)
|
292 | 296 | * [Max Difference Pair](divide_and_conquer/max_difference_pair.py)
|
293 |
| - * [Max Subarray Sum](divide_and_conquer/max_subarray_sum.py) |
| 297 | + * [Max Subarray](divide_and_conquer/max_subarray.py) |
294 | 298 | * [Mergesort](divide_and_conquer/mergesort.py)
|
295 | 299 | * [Peak](divide_and_conquer/peak.py)
|
296 | 300 | * [Power](divide_and_conquer/power.py)
|
|
321 | 325 | * [Matrix Chain Order](dynamic_programming/matrix_chain_order.py)
|
322 | 326 | * [Max Non Adjacent Sum](dynamic_programming/max_non_adjacent_sum.py)
|
323 | 327 | * [Max Product Subarray](dynamic_programming/max_product_subarray.py)
|
324 |
| - * [Max Sub Array](dynamic_programming/max_sub_array.py) |
325 |
| - * [Max Sum Contiguous Subsequence](dynamic_programming/max_sum_contiguous_subsequence.py) |
| 328 | + * [Max Subarray Sum](dynamic_programming/max_subarray_sum.py) |
326 | 329 | * [Min Distance Up Bottom](dynamic_programming/min_distance_up_bottom.py)
|
327 | 330 | * [Minimum Coin Change](dynamic_programming/minimum_coin_change.py)
|
328 | 331 | * [Minimum Cost Path](dynamic_programming/minimum_cost_path.py)
|
|
333 | 336 | * [Minimum Tickets Cost](dynamic_programming/minimum_tickets_cost.py)
|
334 | 337 | * [Optimal Binary Search Tree](dynamic_programming/optimal_binary_search_tree.py)
|
335 | 338 | * [Palindrome Partitioning](dynamic_programming/palindrome_partitioning.py)
|
| 339 | + * [Regex Match](dynamic_programming/regex_match.py) |
336 | 340 | * [Rod Cutting](dynamic_programming/rod_cutting.py)
|
337 | 341 | * [Subset Generation](dynamic_programming/subset_generation.py)
|
338 | 342 | * [Sum Of Subset](dynamic_programming/sum_of_subset.py)
|
| 343 | + * [Tribonacci](dynamic_programming/tribonacci.py) |
339 | 344 | * [Viterbi](dynamic_programming/viterbi.py)
|
340 | 345 | * [Word Break](dynamic_programming/word_break.py)
|
341 | 346 |
|
|
410 | 415 | * [Dijkstra 2](graphs/dijkstra_2.py)
|
411 | 416 | * [Dijkstra Algorithm](graphs/dijkstra_algorithm.py)
|
412 | 417 | * [Dijkstra Alternate](graphs/dijkstra_alternate.py)
|
| 418 | + * [Dijkstra Binary Grid](graphs/dijkstra_binary_grid.py) |
413 | 419 | * [Dinic](graphs/dinic.py)
|
414 | 420 | * [Directed And Undirected (Weighted) Graph](graphs/directed_and_undirected_(weighted)_graph.py)
|
415 | 421 | * [Edmonds Karp Multiple Source And Sink](graphs/edmonds_karp_multiple_source_and_sink.py)
|
|
419 | 425 | * [Frequent Pattern Graph Miner](graphs/frequent_pattern_graph_miner.py)
|
420 | 426 | * [G Topological Sort](graphs/g_topological_sort.py)
|
421 | 427 | * [Gale Shapley Bigraph](graphs/gale_shapley_bigraph.py)
|
| 428 | + * [Graph Adjacency List](graphs/graph_adjacency_list.py) |
| 429 | + * [Graph Adjacency Matrix](graphs/graph_adjacency_matrix.py) |
422 | 430 | * [Graph List](graphs/graph_list.py)
|
423 |
| - * [Graph Matrix](graphs/graph_matrix.py) |
424 | 431 | * [Graphs Floyd Warshall](graphs/graphs_floyd_warshall.py)
|
425 | 432 | * [Greedy Best First](graphs/greedy_best_first.py)
|
426 | 433 | * [Greedy Min Vertex Cover](graphs/greedy_min_vertex_cover.py)
|
|
479 | 486 | * [Lib](linear_algebra/src/lib.py)
|
480 | 487 | * [Polynom For Points](linear_algebra/src/polynom_for_points.py)
|
481 | 488 | * [Power Iteration](linear_algebra/src/power_iteration.py)
|
| 489 | + * [Rank Of Matrix](linear_algebra/src/rank_of_matrix.py) |
482 | 490 | * [Rayleigh Quotient](linear_algebra/src/rayleigh_quotient.py)
|
483 | 491 | * [Schur Complement](linear_algebra/src/schur_complement.py)
|
484 | 492 | * [Test Linear Algebra](linear_algebra/src/test_linear_algebra.py)
|
485 | 493 | * [Transformations 2D](linear_algebra/src/transformations_2d.py)
|
486 | 494 |
|
| 495 | +## Linear Programming |
| 496 | + * [Simplex](linear_programming/simplex.py) |
| 497 | + |
487 | 498 | ## Machine Learning
|
488 | 499 | * [Astar](machine_learning/astar.py)
|
489 | 500 | * [Data Transformations](machine_learning/data_transformations.py)
|
|
503 | 514 | * Lstm
|
504 | 515 | * [Lstm Prediction](machine_learning/lstm/lstm_prediction.py)
|
505 | 516 | * [Multilayer Perceptron Classifier](machine_learning/multilayer_perceptron_classifier.py)
|
506 |
| - * [Polymonial Regression](machine_learning/polymonial_regression.py) |
| 517 | + * [Polynomial Regression](machine_learning/polynomial_regression.py) |
507 | 518 | * [Scoring Functions](machine_learning/scoring_functions.py)
|
508 | 519 | * [Self Organizing Map](machine_learning/self_organizing_map.py)
|
509 | 520 | * [Sequential Minimum Optimization](machine_learning/sequential_minimum_optimization.py)
|
|
514 | 525 | * [Xgboost Regressor](machine_learning/xgboost_regressor.py)
|
515 | 526 |
|
516 | 527 | ## Maths
|
517 |
| - * [3N Plus 1](maths/3n_plus_1.py) |
518 | 528 | * [Abs](maths/abs.py)
|
519 | 529 | * [Add](maths/add.py)
|
520 | 530 | * [Addition Without Arithmetic](maths/addition_without_arithmetic.py)
|
|
545 | 555 | * [Chudnovsky Algorithm](maths/chudnovsky_algorithm.py)
|
546 | 556 | * [Collatz Sequence](maths/collatz_sequence.py)
|
547 | 557 | * [Combinations](maths/combinations.py)
|
| 558 | + * [Continued Fraction](maths/continued_fraction.py) |
548 | 559 | * [Decimal Isolate](maths/decimal_isolate.py)
|
549 | 560 | * [Decimal To Fraction](maths/decimal_to_fraction.py)
|
550 | 561 | * [Dodecahedron](maths/dodecahedron.py)
|
|
563 | 574 | * [Fermat Little Theorem](maths/fermat_little_theorem.py)
|
564 | 575 | * [Fibonacci](maths/fibonacci.py)
|
565 | 576 | * [Find Max](maths/find_max.py)
|
566 |
| - * [Find Max Recursion](maths/find_max_recursion.py) |
567 | 577 | * [Find Min](maths/find_min.py)
|
568 |
| - * [Find Min Recursion](maths/find_min_recursion.py) |
569 | 578 | * [Floor](maths/floor.py)
|
570 | 579 | * [Gamma](maths/gamma.py)
|
571 | 580 | * [Gamma Recursive](maths/gamma_recursive.py)
|
|
578 | 587 | * [Hardy Ramanujanalgo](maths/hardy_ramanujanalgo.py)
|
579 | 588 | * [Hexagonal Number](maths/hexagonal_number.py)
|
580 | 589 | * [Integration By Simpson Approx](maths/integration_by_simpson_approx.py)
|
| 590 | + * [Interquartile Range](maths/interquartile_range.py) |
581 | 591 | * [Is Int Palindrome](maths/is_int_palindrome.py)
|
582 | 592 | * [Is Ip V4 Address Valid](maths/is_ip_v4_address_valid.py)
|
583 | 593 | * [Is Square Free](maths/is_square_free.py)
|
584 | 594 | * [Jaccard Similarity](maths/jaccard_similarity.py)
|
585 | 595 | * [Juggler Sequence](maths/juggler_sequence.py)
|
586 |
| - * [Kadanes](maths/kadanes.py) |
587 | 596 | * [Karatsuba](maths/karatsuba.py)
|
588 | 597 | * [Krishnamurthy Number](maths/krishnamurthy_number.py)
|
589 | 598 | * [Kth Lexicographic Permutation](maths/kth_lexicographic_permutation.py)
|
590 | 599 | * [Largest Of Very Large Numbers](maths/largest_of_very_large_numbers.py)
|
591 |
| - * [Largest Subarray Sum](maths/largest_subarray_sum.py) |
592 | 600 | * [Least Common Multiple](maths/least_common_multiple.py)
|
593 | 601 | * [Line Length](maths/line_length.py)
|
594 | 602 | * [Liouville Lambda](maths/liouville_lambda.py)
|
|
651 | 659 | * [Sigmoid Linear Unit](maths/sigmoid_linear_unit.py)
|
652 | 660 | * [Signum](maths/signum.py)
|
653 | 661 | * [Simpson Rule](maths/simpson_rule.py)
|
| 662 | + * [Simultaneous Linear Equation Solver](maths/simultaneous_linear_equation_solver.py) |
654 | 663 | * [Sin](maths/sin.py)
|
655 | 664 | * [Sock Merchant](maths/sock_merchant.py)
|
656 | 665 | * [Softmax](maths/softmax.py)
|
|
676 | 685 | ## Matrix
|
677 | 686 | * [Binary Search Matrix](matrix/binary_search_matrix.py)
|
678 | 687 | * [Count Islands In Matrix](matrix/count_islands_in_matrix.py)
|
| 688 | + * [Count Negative Numbers In Sorted Matrix](matrix/count_negative_numbers_in_sorted_matrix.py) |
679 | 689 | * [Count Paths](matrix/count_paths.py)
|
680 | 690 | * [Cramers Rule 2X2](matrix/cramers_rule_2x2.py)
|
681 | 691 | * [Inverse Of Matrix](matrix/inverse_of_matrix.py)
|
|
702 | 712 | * [Exponential Linear Unit](neural_network/activation_functions/exponential_linear_unit.py)
|
703 | 713 | * [Back Propagation Neural Network](neural_network/back_propagation_neural_network.py)
|
704 | 714 | * [Convolution Neural Network](neural_network/convolution_neural_network.py)
|
705 |
| - * [Input Data](neural_network/input_data.py) |
706 | 715 | * [Perceptron](neural_network/perceptron.py)
|
707 | 716 | * [Simple Neural Network](neural_network/simple_neural_network.py)
|
708 | 717 |
|
|
723 | 732 | * [Linear Congruential Generator](other/linear_congruential_generator.py)
|
724 | 733 | * [Lru Cache](other/lru_cache.py)
|
725 | 734 | * [Magicdiamondpattern](other/magicdiamondpattern.py)
|
726 |
| - * [Maximum Subarray](other/maximum_subarray.py) |
727 | 735 | * [Maximum Subsequence](other/maximum_subsequence.py)
|
728 | 736 | * [Nested Brackets](other/nested_brackets.py)
|
| 737 | + * [Number Container System](other/number_container_system.py) |
729 | 738 | * [Password](other/password.py)
|
730 | 739 | * [Quine](other/quine.py)
|
731 | 740 | * [Scoring Algorithm](other/scoring_algorithm.py)
|
732 | 741 | * [Sdes](other/sdes.py)
|
733 | 742 | * [Tower Of Hanoi](other/tower_of_hanoi.py)
|
734 | 743 |
|
735 | 744 | ## Physics
|
| 745 | + * [Altitude Pressure](physics/altitude_pressure.py) |
736 | 746 | * [Archimedes Principle](physics/archimedes_principle.py)
|
| 747 | + * [Basic Orbital Capture](physics/basic_orbital_capture.py) |
737 | 748 | * [Casimir Effect](physics/casimir_effect.py)
|
738 | 749 | * [Centripetal Force](physics/centripetal_force.py)
|
739 | 750 | * [Grahams Law](physics/grahams_law.py)
|
|
749 | 760 | * [Potential Energy](physics/potential_energy.py)
|
750 | 761 | * [Rms Speed Of Molecule](physics/rms_speed_of_molecule.py)
|
751 | 762 | * [Shear Stress](physics/shear_stress.py)
|
| 763 | + * [Speed Of Sound](physics/speed_of_sound.py) |
752 | 764 |
|
753 | 765 | ## Project Euler
|
754 | 766 | * Problem 001
|
|
1054 | 1066 | * [Q Fourier Transform](quantum/q_fourier_transform.py)
|
1055 | 1067 | * [Q Full Adder](quantum/q_full_adder.py)
|
1056 | 1068 | * [Quantum Entanglement](quantum/quantum_entanglement.py)
|
1057 |
| - * [Quantum Random](quantum/quantum_random.py) |
1058 | 1069 | * [Quantum Teleportation](quantum/quantum_teleportation.py)
|
1059 | 1070 | * [Ripple Adder Classic](quantum/ripple_adder_classic.py)
|
1060 | 1071 | * [Single Qubit Measure](quantum/single_qubit_measure.py)
|
|
1160 | 1171 | * [Is Pangram](strings/is_pangram.py)
|
1161 | 1172 | * [Is Spain National Id](strings/is_spain_national_id.py)
|
1162 | 1173 | * [Is Srilankan Phone Number](strings/is_srilankan_phone_number.py)
|
| 1174 | + * [Is Valid Email Address](strings/is_valid_email_address.py) |
1163 | 1175 | * [Jaro Winkler](strings/jaro_winkler.py)
|
1164 | 1176 | * [Join](strings/join.py)
|
1165 | 1177 | * [Knuth Morris Pratt](strings/knuth_morris_pratt.py)
|
|
0 commit comments