|
14 | 14 | * [Generate Parentheses](backtracking/generate_parentheses.py)
|
15 | 15 | * [Hamiltonian Cycle](backtracking/hamiltonian_cycle.py)
|
16 | 16 | * [Knight Tour](backtracking/knight_tour.py)
|
| 17 | + * [M Coloringproblem](backtracking/m_coloringproblem.py) |
17 | 18 | * [Match Word Pattern](backtracking/match_word_pattern.py)
|
18 | 19 | * [Minimax](backtracking/minimax.py)
|
19 | 20 | * [N Queens](backtracking/n_queens.py)
|
|
40 | 41 | * [Count Number Of One Bits](bit_manipulation/count_number_of_one_bits.py)
|
41 | 42 | * [Excess 3 Code](bit_manipulation/excess_3_code.py)
|
42 | 43 | * [Find Previous Power Of Two](bit_manipulation/find_previous_power_of_two.py)
|
| 44 | + * [Find Unique Number](bit_manipulation/find_unique_number.py) |
43 | 45 | * [Gray Code Sequence](bit_manipulation/gray_code_sequence.py)
|
44 | 46 | * [Highest Set Bit](bit_manipulation/highest_set_bit.py)
|
45 | 47 | * [Index Of Rightmost Set Bit](bit_manipulation/index_of_rightmost_set_bit.py)
|
|
270 | 272 | * [Merge Two Lists](data_structures/linked_list/merge_two_lists.py)
|
271 | 273 | * [Middle Element Of Linked List](data_structures/linked_list/middle_element_of_linked_list.py)
|
272 | 274 | * [Print Reverse](data_structures/linked_list/print_reverse.py)
|
| 275 | + * [Remove Loop](data_structures/linked_list/remove_loop.py) |
273 | 276 | * [Reverse K Group](data_structures/linked_list/reverse_k_group.py)
|
274 | 277 | * [Rotate To The Right](data_structures/linked_list/rotate_to_the_right.py)
|
275 | 278 | * [Singly Linked List](data_structures/linked_list/singly_linked_list.py)
|
|
286 | 289 | * [Queue On Pseudo Stack](data_structures/queues/queue_on_pseudo_stack.py)
|
287 | 290 | * Stacks
|
288 | 291 | * [Balanced Parentheses](data_structures/stacks/balanced_parentheses.py)
|
| 292 | + * [Celebrity Problem](data_structures/stacks/celebrity_problem.py) |
289 | 293 | * [Dijkstras Two Stack Algorithm](data_structures/stacks/dijkstras_two_stack_algorithm.py)
|
290 | 294 | * [Infix To Postfix Conversion](data_structures/stacks/infix_to_postfix_conversion.py)
|
291 | 295 | * [Infix To Prefix Conversion](data_structures/stacks/infix_to_prefix_conversion.py)
|
|
471 | 475 |
|
472 | 476 | ## Graphs
|
473 | 477 | * [A Star](graphs/a_star.py)
|
| 478 | + * [Adjascency List](graphs/adjascency_list.py) |
474 | 479 | * [Ant Colony Optimization Algorithms](graphs/ant_colony_optimization_algorithms.py)
|
475 | 480 | * [Articulation Points](graphs/articulation_points.py)
|
476 | 481 | * [Basic Graphs](graphs/basic_graphs.py)
|
|
570 | 575 | * [Gaussian Elimination](linear_algebra/gaussian_elimination.py)
|
571 | 576 | * [Jacobi Iteration Method](linear_algebra/jacobi_iteration_method.py)
|
572 | 577 | * [Lu Decomposition](linear_algebra/lu_decomposition.py)
|
| 578 | + * [Matrix Inversion](linear_algebra/matrix_inversion.py) |
573 | 579 | * Src
|
574 | 580 | * [Conjugate Gradient](linear_algebra/src/conjugate_gradient.py)
|
575 | 581 | * [Gaussian Elimination Pivoting](linear_algebra/src/gaussian_elimination_pivoting.py)
|
|
1153 | 1159 | * [Sol1](project_euler/problem_120/sol1.py)
|
1154 | 1160 | * Problem 121
|
1155 | 1161 | * [Sol1](project_euler/problem_121/sol1.py)
|
| 1162 | + * Problem 122 |
| 1163 | + * [Sol1](project_euler/problem_122/sol1.py) |
1156 | 1164 | * Problem 123
|
1157 | 1165 | * [Sol1](project_euler/problem_123/sol1.py)
|
1158 | 1166 | * Problem 125
|
|
0 commit comments