Open Pull Request File Map

[cclauss]

Open Pull Request File Map

• Script: scripts/pr_file_map.py
• Generated (UTC): 2026-09-15T23:23:44.906925+00:00
• Number of PRs: 388
• File touches (PR x file): 486
• Distinct files touched: 375
• Files touched by more than one PR: 47 (excluding DIRECTORY.md)
• Open PRs touching DIRECTORY.md: 48

47 files touched by more than one open PR (possible merge conflicts)

Coordinate, rebase, or land these together to avoid conflicts.

• machine_learning/linear_regression.py (4 PRs): Update linear_regression.py #11567 Contributes to #9943 by add tests in linear regression #11622 Added Exception Handling and type hinting #11802 Add regression visualization #14637
• maths/factorial.py (4 PRs): fix-factorial-validation: Fix input validation and doctests #13818 I have updated the print statement to understand #13994 Add recursive factorial implementation #14158 docs: improve module docstring clarity for factorial #14216
• sorts/pancake_sort.py (4 PRs): docs: Add type hints and improve documentation for pancake_sort #13960 Improve: add type hints to pancake_sort #14738 chore: add type hints to pancake_sort #14841 sorts: make pancake_sort generic over Comparable items #15311
• sorts/quick_sort.py (4 PRs): Added complexities #11725 sorts: make quick sort support comparable items #15290 sorts: make quick_sort work with any Comparable, not just int #15327 sorts: make bogo_sort work with any Comparable, not just int #15331
• tests/test_sorts.py (4 PRs): sorts: make pancake_sort generic over Comparable items #15311 sorts: make cycle_sort generic for comparable items #15329 sorts: type shrink shell sort for comparable items #15334 sorts: make recursive_insertion_sort generic over Comparable items #15340
• graphs/directed_and_undirected_weighted_graph.py (3 PRs): Add doctests to DFS and BFS. Contributes to #9943 #11757 Test cases for graphs/directed and undirected weighted graph.py #12287 Add to doctests #12790
• graphs/graphs_floyd_warshall.py (3 PRs): Add doctests to graphs_floyd_warshall.py #11820 Unit tests #12125 Improve Test Coverage with Doctests for Floyd Warshall algorithm #12616
• matrix/count_islands_in_matrix.py (3 PRs): Added doctests for matrix/count_islands_in_matrix.py #12555 Contributes to #9943: Add docstrings and doctests, fix is_safe logic, and improve code formatting  #12691 Added the doctests - Contributes to #9943 #13716
• searches/linear_search.py (3 PRs): Fix: Improve docstrings and use ValueError in rec_linear_search #14626 Improve: Handle empty sequence case in linear_search #14627 Replace generic exception with ValueError in linear search #14641
• sorts/insertion_sort.py (3 PRs): improve docstrings in insertion_sort.py to include complexity analysis #14868 Add time and space complexity analysis to insertion_sort docstring #15054 test: verify insertion sort modifies input collection #15335
• sorts/shell_sort.py (3 PRs): Add Shell Sort Algorithm #13911 sorts: make shell_sort work with any Comparable, not just int #15326 sorts: make bogo_sort work with any Comparable, not just int #15331
• strings/camel_case_to_snake_case.py (3 PRs): corrected the typos in camel_case_to_snake_case.py #14832 Add docstring frequency finder #14833 Correct typos and add secret_language file #14843
• .python-version (2 PRs): CI: try Python 3.15t release candidate (DRAFT — do not merge until 3.15t GA) #15105 python3.15t #15142
• backtracking/all_permutations.py (2 PRs): Test cases for all_permutations #10662 Added doctests [Contributes to #9943] #13106
• blockchain/README.md (2 PRs): Updated blockchain readme #12792 Update README.md #13296
• blockchain/proof_of_stake.py (2 PRs): Added Proof of Stake(PoS) #11945 New: Added proof of work(PoW) #11946
• boolean_algebra/and_gate.py (2 PRs): Updated the error handling in and_gate.py #13236 Update and_gate.py #13701
• ciphers/cryptomath_module.py (2 PRs): Add doctests to cryptomath_module #13147 Add doctests to cryptomath_module.py #13217
• ciphers/skytale_cipher.py (2 PRs): (ciphers): add scytale (skytale) transposition cipher with doctests #13100 Feat/ciphers columnar #13102
• conversions/binary_to_decimal.py (2 PRs): Update binary_to_decimal.py #11919 Refactor binary to decimal conversion function #14571
• conversions/roman_numerals.py (2 PRs): fix: int_to_roman silently returns wrong values for out-of-range input #14635 feat(conversions): add input validation and fix bugs in Roman Numerals #14871
• divide_and_conquer/strassen_matrix_multiplication.py (2 PRs): optimize split_matrix function #12552 Docs/strassen docstring complexity #14095
• electronics/wheatstone_bridge.py (2 PRs): Refine Wheatstone Bridge explanation #14031 Improve wheatstone docs #14275
• geometry/geometry.py (2 PRs): Add triangle in Geometry #12980 Fix ellipse perimeter calculation #13690
• graphics/bresenham_line_basic.py (2 PRs): Added Bresenham Line Algorithm basic version for first quadrant #13750 Bresenham line advanced algorithm which handles all octants ( for hacktoberfest ) #13751
• graphics/digital_differential_analyzer_line.py (2 PRs): Docs: Improve docstring for DDA algorithm #13906 fix(dda): fix docstring #enhancement 13905 #13909
• graphs/dijkstra_2.py (2 PRs): Add doctests to dijkstra_2.py #11823 Tests/doctests dijkstra 2 #13036
• hashes/chaos_machine.py (2 PRs): fix: inverted loop condition in chaos_machine.py prevents execution #14777 Remove unnecessary global declarations, inline inner function and fix main loop while condition in chaos_machine #14814
• hashes/crc32.py (2 PRs): feat: add CRC32 hash algorithm implementation #14035 Add CRC-32 checksum implementation #14415
• machine_learning/apriori_algorithm.py (2 PRs): Refactor Apriori Algorithm: Fix Pruning Logic, Add Type Hints, and Pass Lint Checks #12700 Refactor apriori algorithm #14579
• machine_learning/dimensionality_reduction.py (2 PRs): feat: add dimensionality reduction algorithms (PCA, LDA, LLE, MDS) #13118 Add t-SNE implementation and tests for dimensionality reduction #13337
• machine_learning/ridge_regression.py (2 PRs): Add Ridge Regression to Machine Learning #12246 machine_learning: add RidgeRegression with tests and demo #14016
• maths/number_of_digits.py (2 PRs): Fix incorrect doctest and improve log handling in num_digits functions #13850 Fix num_digits_fast for powers of ten #14742
• matrix/matrix_class.py (2 PRs): Contributes to #9943: Add docstrings and doctests, fix is_safe logic, and improve code formatting  #12691 Added the doctests - Contributes to #9943 #13716
• project_euler/problem_060/__init__.py (2 PRs): added project euler problem 60 #10082 Euler project solution 60 #13475
• project_euler/problem_060/sol1.py (2 PRs): added project euler problem 60 #10082 Euler project solution 60 #13475
• project_euler/problem_061/__init__.py (2 PRs): Solve Project Euler 61 #11433 Problem 061 Project Euler #14798
• project_euler/problem_061/sol1.py (2 PRs): Solve Project Euler 61 #11433 Problem 061 Project Euler #14798
• searches/exponential_search.py (2 PRs): Add exponential_search doctest for empty array edge case #13954 fix: handle not-found edges in exponential_search #14806
• searches/interpolation_search.py (2 PRs): Test cases for interpolation_search #10690 Fix out-of-range recursion in interpolation_search_by_recursion #15333
• sorts/selection_sort.py (2 PRs): Enhance docstring for selection_sort function #13963 docs: add time and space complexity to selection_sort docstring #13972
• sorts/stooge_sort.py (2 PRs): Add Stooge Sort implementation #14746 sorts: type stooge_sort for any comparable items #15346
• sorts/topological_sort.py (2 PRs): Updated topological_sort.py #11290 Fix topological sort order #14609
• strings/anagrams.py (2 PRs): Improve docstrings and readability in anagrams module #14188 Improve docstring clarity and typing in anagrams #14219
• strings/boyer_moore_search.py (2 PRs): Improve Boyer-Moore String Search (Bad Character Rule) Implementation #13039 fix: Boyer-Moore bad character shift was dead code in for-loop #14770
• strings/min_cost_string_conversion.py (2 PRs): ✅ Add doctests to string conversion functions #12839 docs: add doctests for min_cost_string_conversion #13601
• strings/suffix_automaton.py (2 PRs): add suffix automaton algo #11217 feat(strings): add suffix automaton implementation #13606

145 existing files

• .python-version: CI: try Python 3.15t release candidate (DRAFT — do not merge until 3.15t GA) #15105 python3.15t #15142
• backtracking/all_permutations.py: Test cases for all_permutations #10662 Added doctests [Contributes to #9943] #13106
• backtracking/crossword_puzzle_solver.py: Improve crossword puzzle solver implementation #14568
• backtracking/minimax.py: Add Minimax with Alpha-Beta Pruning algorithm #14364
• bit_manipulation/count_number_of_one_bits.py: Feature/arun count set bits new approach #13483
• blockchain/README.md: Updated blockchain readme #12792 Update README.md #13296
• blockchain/diophantine_equation.py: feat(blockchain): add all_diophantine_solutions with type hints & doctests #12999
• boolean_algebra/README.md: Added Derived Gates and Modified basic gates along with explanation, symbols, examples and Truth Tables. #13807
• boolean_algebra/and_gate.py: Updated the error handling in and_gate.py #13236 Update and_gate.py #13701
• boolean_algebra/karnaugh_map_simplification.py: updated the kmap simplification algorithm to give the most simplified expression #14792
• ciphers/a1z26.py: Clarify 1-based indexing in a1z26.py docstring #13966
• ciphers/caesar_cipher.py: Fix: cleaned caesar_cipher.py with error handling and better docs #13825
• ciphers/cryptomath_module.py: Add doctests to cryptomath_module #13147 Add doctests to cryptomath_module.py #13217
• ciphers/diffie_hellman.py: Simplify diffie_hellman.py #12541
• conversions/binary_to_decimal.py: Update binary_to_decimal.py #11919 Refactor binary to decimal conversion function #14571
• conversions/binary_to_hexadecimal.py: Simplify bin_to_hexadecimal function #14570
• conversions/excel_title_to_column.py: feat(conversions): add input validation and lowercase support to excel_title_to_column #14872
• conversions/molecular_chemistry.py: feat(conversions): Add mass_to_moles and moles_to_molecules conversions to molecul… #14879
• conversions/roman_numerals.py: fix: int_to_roman silently returns wrong values for out-of-range input #14635 feat(conversions): add input validation and fix bugs in Roman Numerals #14871
• data_compression/coordinate_compression.py: fix(data_compression): handle duplicates correctly and throw consistent ValueError in coordinate_compression #14873
• data_structures/arrays/find_triplets_with_0_sum.py: Add two-pointer method for finding triplets with 0 sum #14186
• data_structures/arrays/product_sum.py: added iterative solution for product sum problem #11133
• data_structures/arrays/rotate_array.py: Add Rotate Array Algorithm (Right Rotation by k Steps) #13093
• data_structures/disjoint_set/disjoint_set.py: Add comprehensive doctests to disjoint_set.py #13619
• data_structures/linked_list/doubly_linked_list.py: Add doubly_to_singly() method to convert a doubly linked list to a singly linked list #14410
• data_structures/trie/trie.py: Enhanced Trie Data Structure Implementation with Complete Documentation and Test Suite #14015
• digital_image_processing/resize/resize.py: Add bilinear and bicubic interpolation #12275
• divide_and_conquer/closest_pair_of_points.py: Fix bugs and typo errors in closest_pair_of_points.py #14363
• divide_and_conquer/inversions.py: task: Add type hints to inversions.py #14262
• divide_and_conquer/strassen_matrix_multiplication.py: optimize split_matrix function #12552 Docs/strassen docstring complexity #14095
• dynamic_programming/egg_dropping.py: Add Egg Dropping Problem (Dynamic Programming) #13824
• dynamic_programming/fibonacci.py: Implement __repr__ method for debugging #13640
• dynamic_programming/knapsack.py: Fix: Update Coin Change Dynamic Programming Algorithm Type Hints and Return Type #13395
• dynamic_programming/longest_common_subsequence.py: feat: add LCS string reconstruction using DP backtracking #14472
• dynamic_programming/optimal_binary_search_tree.py: Add boundary checking to optimal bst #11771
• dynamic_programming/subset_generation.py: Changed the Code to return tuple in dynamic_programming/subset_generation.py#10189 #10382
• dynamic_programming/trapped_water.py: Optimized Trapping Rainwater Solution to O(1) Space (Two-Pointer Approach) #13973
• electronics/wheatstone_bridge.py: Refine Wheatstone Bridge explanation #14031 Improve wheatstone docs #14275
• geometry/geometry.py: Add triangle in Geometry #12980 Fix ellipse perimeter calculation #13690
• graphics/digital_differential_analyzer_line.py: Docs: Improve docstring for DDA algorithm #13906 fix(dda): fix docstring #enhancement 13905 #13909
• graphs/a_star.py: refactor: Upgrade A* pathfinding algorithm with configurable heuristics (#13917) #14718
• graphs/basic_graphs.py: Add doctests to graphs/basic_graphs.py #12881
• graphs/check_bipatrite.py: docs: remove stale bipartite doctest fixmes #14729
• graphs/dijkstra.py: Refactor Dijkstra pseudo-code and function for readability and type s… #11875
• graphs/dijkstra_2.py: Add doctests to dijkstra_2.py #11823 Tests/doctests dijkstra 2 #13036
• graphs/directed_and_undirected_weighted_graph.py: Add doctests to DFS and BFS. Contributes to #9943 #11757 Test cases for graphs/directed and undirected weighted graph.py #12287 Add to doctests #12790
• graphs/eulerian_path_and_circuit_for_undirected_graph.py: Added doctests to eulerian_path_and_circuit_for_undirected_graph.py #11883
• graphs/graphs_floyd_warshall.py: Add doctests to graphs_floyd_warshall.py #11820 Unit tests #12125 Improve Test Coverage with Doctests for Floyd Warshall algorithm #12616
• graphs/page_rank.py: fix: initialize PageRank to 1/n instead of 1 #15024
• graphs/travelling_salesman_problem.py: Added graphs/travelling_salesman_problem.py #12559
• hashes/chaos_machine.py: fix: inverted loop condition in chaos_machine.py prevents execution #14777 Remove unnecessary global declarations, inline inner function and fix main loop while condition in chaos_machine #14814
• hashes/enigma_machine.py: add tests for enigma_machine #10017
• machine_learning/__init__.py: machine_learning: add RidgeRegression with tests and demo #14016
• machine_learning/apriori_algorithm.py: Refactor Apriori Algorithm: Fix Pruning Logic, Add Type Hints, and Pass Lint Checks #12700 Refactor apriori algorithm #14579
• machine_learning/dimensionality_reduction.py: feat: add dimensionality reduction algorithms (PCA, LDA, LLE, MDS) #13118 Add t-SNE implementation and tests for dimensionality reduction #13337
• machine_learning/forecasting/run.py: Added Random Forest Regressor as an additional prediction model. #12767
• machine_learning/gaussian_naive_bayes.py: Add Gaussian Naive Bayes classifier in machine_learning/ #14853
• machine_learning/linear_discriminant_analysis.py: Fix LDA comment grammar #14800
• machine_learning/linear_regression.py: Update linear_regression.py #11567 Contributes to #9943 by add tests in linear regression #11622 Added Exception Handling and type hinting #11802 Add regression visualization #14637
• machine_learning/logistic_regression.py: Refactor logistic regression to OOP class with multi-class support #14923
• machine_learning/support_vector_machines.py: Update support_vector_machines.py to add the polynomial kernel #12748
• machine_learning/t_stochastic_neighbour_embedding.py: Enhancement: t-SNE Script Improvements #13522
• maths/abs.py: Refactor: unify abs usage and expand type hints to float #14142
• maths/addition_without_arithmetic.py: Clarify bitwise operations used in addition without arithmetic #14059
• maths/basic_maths.py: Adding new algorithms which are pretty necessary and improving the readability of algos! #13251
• maths/binomial_distribution.py: fix typo in binomial_distribution.py print statement #14779
• maths/check_polygon.py: Update check_polygon.pyfix(maths): validate minimum sides for polygon in check_polygon.py #15320
• maths/collatz_sequence.py: fix(maths): use specific exception types in collatz_sequence #14769
• maths/entropy.py: refactor: generalize entropy calculation and improve semantic clarity #14202
• maths/factorial.py: fix-factorial-validation: Fix input validation and doctests #13818 I have updated the print statement to understand #13994 Add recursive factorial implementation #14158 docs: improve module docstring clarity for factorial #14216
• maths/fermat_little_theorem.py: Fix binary_exponentiation: integer exponent and floor division, add doctest #14876
• maths/find_max.py: Improve documentation and educational comments in find_max.py #13017
• maths/gcd_of_n_numbers.py: Improve prime factorization correctness and performance in GCD implementation #14190
• maths/greatest_common_divisor.py: Fix and improve module docstring for greatest common divisor #14239
• maths/kth_lexicographic_permutation.py: Fix kth lexicographic permutation #14197
• maths/least_common_multiple.py: Fix ZeroDivisionError on zero operands in least_common_multiple #14845
• maths/lucas_series.py: Optimize Lucas Number Calculation with Matrix Exponentiation #13131
• maths/monte_carlo.py: Add doctests and refactor Monte Carlo estimation functions  #12703
• maths/number_of_digits.py: Fix incorrect doctest and improve log handling in num_digits functions #13850 Fix num_digits_fast for powers of ten #14742
• maths/perfect_number.py: improved perfect number algorithm in maths module #14134
• maths/persistence.py: refactor(maths): use direct iteration instead of index-based loops in persistence.py #14767
• maths/primelib.py: fix: add type hints to maths/primelib.py and fix integer division #14089
• maths/sieve_of_eratosthenes.py: Optimize speed and memory sieve_of_eratosthenes.py (skip evens) #13110
• maths/softmax.py: refactor: add type hints to maths/softmax.py #14153
• maths/sum_of_digits.py: fix(maths): correct recursive call in sum_of_digits_recursion #14768
• maths/trailing_zeroes.py: fix: preserve integer precision in trailing zeroes #15313
• maths/triplet_sum.py: Added doctests for random dataset function #13360
• maths/two_pointer.py: Improve two_pointer documentation and readability #14539
• maths/volume.py: docs: improve vol_cuboid docstring with Wikipedia reference and math formula. #14409
• matrix/count_islands_in_matrix.py: Added doctests for matrix/count_islands_in_matrix.py #12555 Contributes to #9943: Add docstrings and doctests, fix is_safe logic, and improve code formatting  #12691 Added the doctests - Contributes to #9943 #13716
• matrix/matrix_class.py: Contributes to #9943: Add docstrings and doctests, fix is_safe logic, and improve code formatting  #12691 Added the doctests - Contributes to #9943 #13716
• matrix/matrix_operation.py: Added matrix permanent operation #13987
• networking_flow/ford_fulkerson.py: Optimize Ford-Fulkerson algorithm with type annotations and performance improvements #13128
• physics/hamiltonian.py: Add classical and quantum Hamiltonian functions (#13235) #13312
• physics/photoelectric_effect.py: Improve documentation and clarity of photoelectric effect explanation #14030
• physics/potential_energy.py: Add collisions #14787
• project_euler/problem_030/sol1.py: Update sol1.py #13639
• project_euler/problem_034/sol1.py: feat(euler): Optimize problem 034 with a lower upper bound #13531
• project_euler/problem_135/sol1.py: perf: keep Euler 135 arithmetic integral #14990
• project_euler/problem_145/sol1.py: Optimize prob 145 #14694
• searches/binary_search.py: Remove inefficient validation checks in binary search functions #13836
• searches/binary_tree_traversal.py: feat: add test case of binary_tree_travarsal #11825
• searches/exponential_search.py: Add exponential_search doctest for empty array edge case #13954 fix: handle not-found edges in exponential_search #14806
• searches/interpolation_search.py: Test cases for interpolation_search #10690 Fix out-of-range recursion in interpolation_search_by_recursion #15333
• searches/linear_search.py: Fix: Improve docstrings and use ValueError in rec_linear_search #14626 Improve: Handle empty sequence case in linear_search #14627 Replace generic exception with ValueError in linear search #14641
• searches/sentinel_linear_search.py: feat: Add sentinel linear search algorithm #14581
• searches/ternary_search.py: fix(searches): correct ternary search pivots and exclusive bounds #15005
• sorts/binary_insertion_sort.py: Don't implement binary search again #12593
• sorts/bogo_sort.py: sorts: make bogo_sort work with any Comparable, not just int #15331
• sorts/bubble_sort_recursive.py: sorts: make recursive bubble sort support comparable items #15339
• sorts/cycle_sort.py: sorts: make cycle_sort generic for comparable items #15329
• sorts/double_sort.py: sorts: type double_sort for any comparable items #15345
• sorts/gnome_sort.py: Add module docstring gnome sort #14398
• sorts/heap_sort.py: sorts: make quick sort support comparable items #15290
• sorts/insertion_sort.py: improve docstrings in insertion_sort.py to include complexity analysis #14868 Add time and space complexity analysis to insertion_sort docstring #15054 test: verify insertion sort modifies input collection #15335
• sorts/pancake_sort.py: docs: Add type hints and improve documentation for pancake_sort #13960 Improve: add type hints to pancake_sort #14738 chore: add type hints to pancake_sort #14841 sorts: make pancake_sort generic over Comparable items #15311
• sorts/quick_sort.py: Added complexities #11725 sorts: make quick sort support comparable items #15290 sorts: make quick_sort work with any Comparable, not just int #15327 sorts: make bogo_sort work with any Comparable, not just int #15331
• sorts/quick_sort_3_partition.py: Add Hoare partition algorithm #12601
• sorts/radix_sort.py: fix(sorts): raise ValueError on negative inputs in radix_sort (#14950) #15011
• sorts/recursive_insertion_sort.py: sorts: make recursive_insertion_sort generic over Comparable items #15340
• sorts/selection_sort.py: Enhance docstring for selection_sort function #13963 docs: add time and space complexity to selection_sort docstring #13972
• sorts/shell_sort.py: Add Shell Sort Algorithm #13911 sorts: make shell_sort work with any Comparable, not just int #15326 sorts: make bogo_sort work with any Comparable, not just int #15331
• sorts/shrink_shell_sort.py: sorts: type shrink shell sort for comparable items #15334
• sorts/slowsort.py: sorts: type slowsort for any comparable items #15347
• sorts/stooge_sort.py: Add Stooge Sort implementation #14746 sorts: type stooge_sort for any comparable items #15346
• sorts/strand_sort.py: sorts: make strand sort work with comparable types #15350
• sorts/topological_sort.py: Updated topological_sort.py #11290 Fix topological sort order #14609
• strings/anagrams.py: Improve docstrings and readability in anagrams module #14188 Improve docstring clarity and typing in anagrams #14219
• strings/boyer_moore_search.py: Improve Boyer-Moore String Search (Bad Character Rule) Implementation #13039 fix: Boyer-Moore bad character shift was dead code in for-loop #14770
• strings/camel_case_to_snake_case.py: corrected the typos in camel_case_to_snake_case.py #14832 Add docstring frequency finder #14833 Correct typos and add secret_language file #14843
• strings/capitalize.py: Simplify capitalize implementation #14654
• strings/check_anagrams.py: Improve docstring clarity for anagram check function #14058
• strings/frequency_finder.py: Add docstring frequency finder #14833
• strings/is_isogram.py: Improve is_isogram performance by removing unnecessary sorting #15318
• strings/knuth_morris_pratt.py: refactor(strings): Improve and correct KMP implementation #13694
• strings/min_cost_string_conversion.py: ✅ Add doctests to string conversion functions #12839 docs: add doctests for min_cost_string_conversion #13601
• strings/palindrome.py: Add is_palindrome_ignore_case_and_spaces to strings/palindrome.py #14907
• strings/rabin_karp.py: Add Rabin-Karp String Matching Algorithm (#13918) #13947
• strings/split.py: Fixes #14649 #14673
• strings/suffix_automaton.py: add suffix automaton algo #11217 feat(strings): add suffix automaton implementation #13606
• strings/word_occurrence.py: Fix word occurrence doctest variable typo #14909
• tests/test_sorts.py: sorts: make pancake_sort generic over Comparable items #15311 sorts: make cycle_sort generic for comparable items #15329 sorts: type shrink shell sort for comparable items #15334 sorts: make recursive_insertion_sort generic over Comparable items #15340
• web_programming/covid_stats_via_xpath.py: Refactor error handling and improve logging #13000
• web_programming/crawl_google_scholar_citation.py: Update crawl_google_scholar_citation.py #11655
• web_programming/instagram_crawler.py: Instagram Crawler Overhaul using web_profile_info API Fixes#10634 #11193

229 files not present in the working directory

• bit_manipulation/binary_addition.py: Binary Addition of two binary strings input to produce binary string output of any length #10370
• bit_manipulation/count_bits.py: feat: add count_bits algorithm with doctests #13938
• bit_manipulation/fin_two_unique_numbers.py: Add algorithm to find Two unique numbers using bit manipulation with docsets #13216
• bit_manipulation/find_upper_lower_nibble.py: Add function to find upper and lower nibbles with doctests and type hints #13121
• bit_manipulation/hamming_code_generator.py: feat: Introduce hamming code generator #11827
• bit_manipulation/max_xor_bit_trie.py: Added Implementation of Bit_Trie for finding max xor between two numbers in an array #13132
• bit_manipulation/multibit_manipulation.py: Adding multibit-manipulation algorithm implemented with bitwise operations #11418
• bit_manipulation/single_number.py: Single Number Algo Added #12042
• bit_manipulation/sliding_window_xor.py: Add Sliding_Window_XOR working solution #13129
• bit_manipulation/update_bit.py: added program to update bit at given position. #9902
• bit_manipulation/xor_swap_two_integers.py: Add XOR-based swap algorithm for two numbers #13018
• blockchain/pow_algorithm.py: Proof of Work Algorithm for Blockchain #11699
• blockchain/proof_of_stake.py: Added Proof of Stake(PoS) #11945 New: Added proof of work(PoW) #11946
• blockchain/proof_of_work.py: New: Added proof of work(PoW) #11946
• ciphers/base58.py: Added Base58 encoding/decoding in ciphers #12123
• ciphers/columnar_transposition.py: Feat/ciphers columnar #13102
• ciphers/des_ecb.py: [Feature] Implemented DES Algorithm in ECB mode #11785
• ciphers/printable_ascii_vigenere_cipher.py: Implement modified vigenere cipher for all printable ASCII #13452
• ciphers/skytale_cipher.py: (ciphers): add scytale (skytale) transposition cipher with doctests #13100 Feat/ciphers columnar #13102
• ciphers/spiral_transposition.py: Create spiral_transposition.py #13421
• conversions/base64_to_binary.py: Added base64 to binary conversion. #12209
• conversions/binary_to_base64.py: Added binary to base64 conversion #12210
• conversions/convert_base.py: Create convert_base.py #11115
• conversions/hex_to_rgb.py: feat: implements a hex to rgb conversion function #11113
• conversions/int_to_negative_binary_base.py: adding negative binary base conversion algorithms #11213
• conversions/negative_binary_base_to_int.py: adding negative binary base conversion algorithms #11213
• conversions/ounces_to_grams.py: Add ounces to grams conversion. #14079
• data_structures/arrays/Deque.py: Create Deque.py #13419
• data_structures/arrays/dynamic_array.py: Implementing Dynamic array #12271
• data_structures/arrays/first_missing_positive.py: first missing positive algorithm #11199
• data_structures/arrays/gas_station.py: Added gas_station.py #11822
• data_structures/arrays/list_maximum_depth_sum.py: Feat: Implement recursive Max Depth Sum calculation for nested arrays #13502
• data_structures/arrays/longest_consecutive_sequence.py: Longest Consecutive Sequence LeetCode problem #9686
• data_structures/arrays/max_and_min.py: added max and min algo #13345
• data_structures/arrays/merge_intervals.py: added merge interval problem on the array data structure  #14009
• data_structures/arrays/merge_sorted.py: Add Merge Sorted Arrays Algorithm with Type Hints and Doctests #13589
• data_structures/arrays/new_combination.py: Add combinations function for array inputs #12326
• data_structures/arrays/pairwise_iteration.py: Added pairwise iteration algorithms #9645
• data_structures/arrays/pascals_triangle.py: add pascals_triangle in data structure #14026
• data_structures/arrays/remove_duplicates_fromarray.py: Create remove_duplicates_fromarray.py #13192
• data_structures/arrays/reverse_array.py: feat(arrays): Add in-place array reversal algorithm #13370
• data_structures/arrays/set_matrix_zeroes.py: Created set_matrix_zeroes.py #13369
• data_structures/arrays/sliding_window_maximum.py: Implement sliding window maximum algorithm using deque #13661
• data_structures/arrays/two_sum.py: Add docstring and type hints to two_sum #14008
• data_structures/binary_tree/binary-tree-deletion.py: Add files via upload #11924
• data_structures/disjoint_set/progressive_set_intersection.py: feat: add progressive_set_intersection to disjoint_set #14492
• data_structures/hashing/coalesced_hashing.py: feat(hashing): add 6 advanced open addressing algorithms #14048
• data_structures/hashing/fnv_hashtable.py: feat(hashing): add 6 advanced open addressing algorithms #14048
• data_structures/hashing/hopscotch.py: feat(hashing): add 6 advanced open addressing algorithms #14048
• data_structures/hashing/linear_probing.py: feat(hashing): add 6 advanced open addressing algorithms #14048
• data_structures/hashing/power_of_two.py: feat(hashing): add 6 advanced open addressing algorithms #14048
• data_structures/hashing/robin_hood.py: feat(hashing): add 6 advanced open addressing algorithms #14048
• data_structures/hashing/tests/test_advanced_hashing.py: feat(hashing): add 6 advanced open addressing algorithms #14048
• data_structures/linked_list/remove_nth_node_from_end_of_list.py: Remove nth node from end of list #9880
• data_structures/persistent_segment_tree.py: Persistent Segment Tree #12186
• data_structures/queue/monotonic_queue.py: add monotonic queue algorithm #10531
• data_structures/stacks/celebrity_problem.py: Added new algorithm to solve the famous celebrity problem using stack #13112
• data_structures/stacks/postfix_to_infix_conversion.py: Added postfix_to_infix_conversion.py #10607
• data_structures/stacks/postfix_to_prefix_conversion.py: Added postfix-prefix conversion #10474
• data_structures/stacks/stack_tracking_min_max.py: Stack implementation that tracks Min/Max element #9946
• data_structures/trie/binary_trie.py: Create binary_trie.py #11918
• data_structures/trie/segment_tree.py: Add Segment Tree implementation in Python #13327
• data_structures/two_pointer/__init__.py: added two pointer directory and added solution to is_palindrome.py #11566
• data_structures/two_pointer/is_palindrome.py: added two pointer directory and added solution to is_palindrome.py #11566
• data_structures/z_score_normalization.py: Add Z-score normalization algorithm for data standardization #14527
• digital_image_processing/image_data/skeleton_lena.png: Added Skeletonizing and Pruning Operations - DIP #13141
• digital_image_processing/morphological_operations/pruning_operation.py: Added Skeletonizing and Pruning Operations - DIP #13141
• digital_image_processing/morphological_operations/skeletonization_operation.py: Added Skeletonizing and Pruning Operations - DIP #13141
• divide_and_conquer/README.md: Added a readme file for the divide and conquer directory #13519
• divide_and_conquer/fast_fourier_transform.py: Adding fast_fourier_transform.py #13738
• divide_and_conquer/karatsuba_multiplication.py: feat: add Karatsuba multiplication algorithm in divide_and_conquer folder modified #13300
• divide_and_conquer/minimum_element_of_array.py: Add the algorithm to search the minimum element of an array using the… #9688
• divide_and_conquer/tests/__init__.py: optimize split_matrix function #12552
• divide_and_conquer/tests/test_strassen_matrix_multiplication.py: optimize split_matrix function #12552
• dynamic_programming/coin_change.py: Fix: Update Coin Change Dynamic Programming Algorithm Type Hints and Return Type #13395
• dynamic_programming/egg_drop.py: Add Egg Drop algorithm #11697
• dynamic_programming/house_robber.py: New Algorithm added in dynamic_programming  #13471
• dynamic_programming/job_scheduling.py: My first contrib #13361
• dynamic_programming/kadanes_algorithm.py: Add Kadane's algorithm for maximum subarray sum #14525
• dynamic_programming/longest_arithmetic_subsequence.py: Adds Longest Arithmetic Subsequence (Review Reqd) #11712
• dynamic_programming/longest_repeating_subsequence.py: feat: add longest repeating subsequence algorithm #14856
• dynamic_programming/moving_average.py: Add moving average algorithm for sliding window data analysis #14526
• dynamic_programming/partition_equal_subset_sum.py: Add partition equal subset sum to dynamic_programming #14702
• dynamic_programming/weighted_job_scheduling.py: feat: Add Weighted Job Scheduling algorithm to dynamic programming #13378
• electronics/power_factor.py: power factor calculator #11727
• electronics/power_factor_correction.py: Added shunt capacitor power factor correction #9535
• electronics/star_delta_conversions.py: added star delta converter module #9649
• electronics/star_delta_transform.py: Adding algorithm delta-star transformation #12356
• financial/amortization_table.py: Added Amortization Table #11368
• financial/expected_shortfall.py: Add Value at Risk and Expected Shortfall to financial #15051
• financial/fractional_differentiation.py: fractional differentiation for engineering stationary features from financial time series #11851
• financial/get_annuity_due_future_value.py: feat: create (financial) get_annuity_due_future_value function #12357
• financial/get_ordinary_annuity_future_value.py: feat: create get_ordinary_annuity_future_value function in financial #12358
• financial/macaulay_duration.py: Feat macaulay duration #14506
• financial/relative_strength_index.py: Calculate Relative Strength Index (RSI) algorithm #13888
• financial/streaming_moving_average.py: Streaming moving average #11826
• financial/value_at_risk.py: Add Value at Risk and Expected Shortfall to financial #15051
• genetic_algorithm/adjacency_representation.py: Add adjacency representation generator for closed Hamiltonian tours #13645
• genetic_algorithm/basic_number.py: Added an algorithm in how to use genetic algorithm for numbers #9577
• genetic_algorithm/knapsack.py: New Genetic Algorithm solution for Knapsack problem #13234
• genetic_algorithm/ordinal_representation.py: Add ordinal representation generator for closed Hamiltonian tours  #13647
• genetic_algorithm/travelling_salesman_problem.py: add genetic_algorithm/travelling_salesman_problem.py #11228
• geometry/braik_mac_construction.py: Braikenridge-Maclaurin Construction of a Conic #11205
• geometry/collision_detection.py: Add collision detection algorithm (#12569) #13969
• geometry/point_in_polygon.py: Add Point in Polygon algorithm using ray casting #15309
• geometry/point_to_plane_distance.py: Add point to plane distance using Hesse normal form #14360
• graphics/bresenham_line_basic.py: Added Bresenham Line Algorithm basic version for first quadrant #13750 Bresenham line advanced algorithm which handles all octants ( for hacktoberfest ) #13751
• graphics/bresenham_line_generalized.py: Bresenham line advanced algorithm which handles all octants ( for hacktoberfest ) #13751
• graphics/interactive_3d_renderer.py: Tk render 3D #13113
• graphs/array_to_graph.py: Adjust array splitting to handle non-divisible arrays #12526
• graphs/blossom_algorithm.py: Add Blossom algorithm (Edmonds' algorithm) for maximum matching in general graphs #13023
• graphs/edmonds_blossom_algorithm.py: Added edmonds_blossom_algorithm.py. For maximum matching in the graph. #12043 #12056
• graphs/graph_centrality.py: Graph Centrality #11897
• graphs/graph_peripherality.py: Graph Peripherality #11898
• graphs/johnson_graph.py: First Implementation of Johnson Graph Algorithm #12281
• graphs/swim_in_rising_water.py: Add swim_in_rising_water algorithm to graphs directory #13249
• graphs/tests/test_edmonds_blossom_algorithm.py: Added edmonds_blossom_algorithm.py. For maximum matching in the graph. #12043 #12056
• graphs/tests/test_graphs_floyd_warshall.py: Unit tests #12125
• greedy_methods/activity_selection.py: Add activity selection new algorithm #11667
• greedy_methods/gale_shapley_stable_matching.py: Gale shapley stable matching #14264
• greedy_methods/merge_intervals.py: feat: add merge intervals algorithm #14436
• greedy_methods/minimize_deviation_in_array.py: add: Minimum Deviation in Array to greedy_methods #10860
• greedy_methods/sliding_window.py: Create sliding_window.py #11581
• hashes/array_pairs_divisibility.py: Feature/hashes #11652
• hashes/crc32.py: feat: add CRC32 hash algorithm implementation #14035 Add CRC-32 checksum implementation #14415
• hashes/fnv.py: Add FNV-1a hash algorithm implementation #14036
• hashes/fnv1a.py: Add FNV-1a hash algorithm implementation with 32-bit and 64-bit variants #13814
• hashes/joaat.py: feat(hashes): add Jenkins-One-At-A-Time function #14560
• hashes/sha3.py: added: sha-3(Keccak) implementation #14023
• hashes/xxhash.py: Add xxHash32 algorithm implementation #14037
• knapsack/knapsack_graph_generation.py: Add graph generation algorithm for Knapsack problems #12896
• knapsack/knapsack_memoization.py: Knapsack_with_memoization #10180
• linear_algebra/determinant.py: New script demonstrates the implementation of the Sigmoid, tanh function, Matrix determinant and Matrix trace calculation. #13364
• linear_algebra/matrix_trace.py: New script demonstrates the implementation of the Sigmoid, tanh function, Matrix determinant and Matrix trace calculation. #13364
• linear_algebra/qr_decomposition.py: Qr Decomposition #14647
• machine_learning/adaboost.py: Add ml algorithms #13270
• machine_learning/arima.py: Add ARIMA model #13271
• machine_learning/cnn.py: Add cnn model #13273
• machine_learning/k_means_plus_plus.py: Add K-means++ #12976
• machine_learning/multinomial_naive_bayes_classifier.py: Multinomial naive bayes text classifier #9619
• machine_learning/principal_component_analysis.py: Added Principal Component Analysis #9610
• machine_learning/ridge_regression.py: Add Ridge Regression to Machine Learning #12246 machine_learning: add RidgeRegression with tests and demo #14016
• machine_learning/tests/__init__.py: machine_learning: add RidgeRegression with tests and demo #14016
• machine_learning/tests/conftest.py: machine_learning: add RidgeRegression with tests and demo #14016
• machine_learning/tests/test_ridge_regression.py: machine_learning: add RidgeRegression with tests and demo #14016
• maths/baby_step_giant_step.py: Add baby-step giant-step discrete logarithm algorithm #14997
• maths/numerical_analysis/nth_root.py: Add algorithm for approximating the nth root with Newton's Method #11509
• maths/sum_of_outcomes_for_rolling_n_sided_dice_k_time.py: The sum of outcomes for rolling an N-sided dice K times. #11463
• matrix/Flood Fill: Create Flood Fill #13187
• matrix/kronecker_product.py: [Add] Kronecker Product #12023
• matrix/matrix_diagonal_sum.py: Add matrix multiplication function with validation #13934
• matrix/similar_matrices.py: Add similarity test for square matrices #13022
• matrix/strassen_matrix_multiply.py: Added the Strassen's Matrix Multiplication Algorithm #13482
• matrix/transitive_closure.py: Transitive Closure Algorithm #12940
• neural_network/activation_functions/sigmoid.py: New script demonstrates the implementation of the Sigmoid, tanh function, Matrix determinant and Matrix trace calculation. #13364
• neural_network/activation_functions/softsign.py: feat: Add Softsign activation function #13133
• neural_network/activation_functions/tanh.py: New script demonstrates the implementation of the Sigmoid, tanh function, Matrix determinant and Matrix trace calculation. #13364
• neural_network/backpropagation_weight_decay.py: Backpropagation weight decay #12421
• neural_network/lstm.py: Adding LSTM algorithm from scratch in neural network algorithm sections #12082
• neural_network/recurrent_neural_network.py: Added the algorithm for RNN #13514
• neural_network/sliding_window_attention.py: shortened the lines #12214
• other/dancing_links.py: Add Dancing Links (DLX) algorithm for Exact Cover problem #13183
• other/pipeline.py: Add Functional Programming Pipeline with Unix Pipeline Syntax #12413
• other/pyramid_patterns.py: Add pattern printing (pyramid, inverted pyramid, diamond) [#13460] #13462
• other/shuffled_array.py: algorithm for shuffling elements of an array. #12540
• other/simple_recursion.py: Add simple recursion examples: factorial, fibonacci, sum_of_digits #12834
• other/token_bucket.py: added Token Bucket rate limiter algorithm #11882
• physics/boyles_law.py: feat: ✨ Implementation of Boyle's law #9914
• physics/collision_detection.py: added collision detection between primitives like circle, rectangle e… #13002
• physics/collisions.py: Add collisions #14787
• physics/diffraction.py: finding different diffraction parameters #11608
• project_euler/problem_002/sol6.py: Create sol6.py for project_eular/problem_002 #11164
• project_euler/problem_005/sol3.py: Add solution 3 for project euler problem 5. #12763
• project_euler/problem_013/sol2.py: Add second solution for the Euler project problem 13. #12764
• project_euler/problem_016/sol3.py: Add third solution for the Euler project problem 16. #12777
• project_euler/problem_025/sol4.py: Create sol4.py for project_euler-problem_025 #11167
• project_euler/problem_025/sol5.py: Create sol5.py for project_eular/problem_025 #11174
• project_euler/problem_060/__init__.py: added project euler problem 60 #10082 Euler project solution 60 #13475
• project_euler/problem_060/sol1.py: added project euler problem 60 #10082 Euler project solution 60 #13475
• project_euler/problem_061/__init__.py: Solve Project Euler 61 #11433 Problem 061 Project Euler #14798
• project_euler/problem_061/sol1.py: Solve Project Euler 61 #11433 #14798
• project_euler/problem_066/__init__.py: #14801
• project_euler/problem_066/sol1.py: #14801
• project_euler/problem_096/__init__.py: #13013
• project_euler/problem_096/sol1.py: #13013
• project_euler/problem_096/sudoku.txt: #13013
• project_euler/problem_111/__init__.py: #12684
• project_euler/problem_111/sol1.py: #12684
• project_euler/problem_124/__init__.py: #12690
• project_euler/problem_124/sol1.py: #12690
• project_euler/problem_137/__init__.py: #12694
• project_euler/problem_137/sol1.py: #12694
• project_euler/problem_138/__init__.py: #12701
• project_euler/problem_138/sol1.py: #12701
• project_euler/problem_142/__init__.py: #12706
• project_euler/problem_142/sol1.py: #12706
• quantum/e91_qkd.py.DISABLED.txt: #13033
• quantum/shor_algorithm.py: #12317
• searches/binary_search_recursion.py: #14056
• searches/binarysearch_on_sorted_2d_array.py: #12100
• searches/floyds_cycle_finding.py: #13609
• searches/segment_tree.py: #12594
• sorts/bubble_sort_optimized.py: #13977
• sorts/count_inversion.py: #12696
• sorts/reverse_selection_sort.py: #11910
• sorts/smooth Sort: #13551
• sorts/split_workload.py: #10271
• sorts/stopwatch_sort.py: #12355
• strings/booths_algorithm.py: #12311
• strings/bpe_tokenizer.py: #11782
• strings/check_anagram.py: #12188
• strings/decode_string.py: #11092
• strings/integer_to_roman.py: #13941
• strings/is_isomorphic.py: #13014
• strings/is_kebab_case.py: #12206
• strings/largest_smallest_words.py: #10234
• strings/longest_common_prefix.py: #13371
• strings/longest_common_subsequence.py: #12895
• strings/longest_palindrome: #11556
• strings/longest_substring_without_repeating_characters.py: #10460
• strings/longest_word_in_sentence.py: #11475
• strings/min_window_substring.py: #12133
• strings/reverse_string.py: #13707
• strings/secret_language.py: #14843
• strings/string_is_valid_number.py: #11479
• strings/suffix_array.py: #15319
• strings/valid_anagram.py: #13297
• web_programming/crypto_price.py: #13016
• web_programming/crypto_price_tracker.py: #13797

48 open PRs touch DIRECTORY.md

DIRECTORY.md is auto-generated, so nearly every PR touches it. A merge conflict caused only by this file is cleared by choosing accept both in the GitHub UI -- no rebase needed.

44 PRs whose only overlap is DIRECTORY.md (safe to accept both)

#9535 #9577 #9619 #9645 #9902 #10370 #10474 #11113 #11418 #11463 #11509 #11608 #11667 #11699 #11782 #11827 #11883 #11910 #11924 #12042 #12206 #12271 #12281 #12317 #12356 #12413 #12421 #12540 #12767 #12834 #12940 #12976 #13014 #13141 #13234 #13270 #13271 #13273 #13378 #13452 #13589 #13609 #14056 #14363

4 PRs that also overlap on other files (need a review or rebase)

• #12246: also touches machine_learning/ridge_regression.py
• #13475: also touches project_euler/problem_060/__init__.py, project_euler/problem_060/sol1.py
• #14016: also touches machine_learning/ridge_regression.py
• #15142: also touches .python-version

[cclauss]

@priya-sundaram-dev, in the Files not present in the working directory section above, can you please review the bit_manipulation pull requests and provide a list of ready-to-merge PRs?

[pricklymusic]

PR #13984 touches nearly every file in bit_manipulation, so reviewing and merging

[priya-sundaram-dev]

Reviewed the bit_manipulation PRs. All nine are CI-green, but the directory has heavy overlap — several PRs touch the same file, and #13984 touches almost the whole directory — so merge order is the real constraint. My read:

Ready to merge (clean, single-file, standards-compliant)

• fix: validate binary_and inputs #15277 — best of the batch. Single file (binary_and_operator.py), adds a proper int type check, fixes the error message (positive → non-negative), and adds passing doctests for the new failure modes. I'd merge this first.

Good, but pick-one / needs a direction call

• add bit_manipulation: add parity, next_power_of_two, rotate_bits codes #13157 — adds three new algorithms (parity, next_power_of_two, rotate_bits). I checked: none duplicate existing files (is_power_of_two.py/find_previous_power_of_two.py/power_of_4.py are distinct). Needs a full algorithm+doctest review since it's new code, but no blocker found — solid candidate after review.
• Bit manipulation: add type hints, validation, doctests; simplify bitw… #13550 — 4 files; removes the explanatory docstrings from is_even.py, which runs directly counter to Updated docs for bit manipluation #13984's doc-expansion. It's also multi-file. Needs a direction call before merge.
• Feature/arun count set bits new approach #13483 vs add bit_manipulation: add parity, next_power_of_two, rotate_bits codes #13157 vs Updated docs for bit manipluation #13984 all touch count_number_of_one_bits.py; Add is_even_using_shift_operator function #13484 vs Bit manipulation: add type hints, validation, doctests; simplify bitw… #13550 vs Updated docs for bit manipluation #13984 both touch is_even.py. Only one of each set can land without a rebase.

Not ready

• Counting 0s and 1s:Update binary_count_trailing_zeros.py #12033 — recommend close. It appends an unrelated count_zeros_and_ones() with no type hints, no doctests, and a top-level print() that runs on import — fails CONTRIBUTING standards regardless of CI.
• Fix incorrect handling of zero input in binary_count_trailing_zeros #14495 and fix: binary_count_trailing_zeros #14574 — both fix the genuine zero-input bug in binary_count_trailing_zeros.py, but both are currently in merge conflict (mergeable_state: dirty) and overlap each other. Pick one, ask for a rebase.

The #13984 question

#13984 (docs across 13 files) has good content but violates the one-file-per-PR guideline and will conflict with every other PR here. Cleanest path: land the small single-file functional PRs first (start with #15277), then have #13984 rebase and mop up the docs last. Merging #13984 first would force a rebase on everything else.

• Suggested merge sequence: fix: validate binary_and inputs #15277 → review+merge add bit_manipulation: add parity, next_power_of_two, rotate_bits codes #13157 → decide is_even direction (Add is_even_using_shift_operator function #13484 or Bit manipulation: add type hints, validation, doctests; simplify bitw… #13550) → pick one trailing-zeros fix (Fix incorrect handling of zero input in binary_count_trailing_zeros #14495/fix: binary_count_trailing_zeros #14574, after rebase) → close Counting 0s and 1s:Update binary_count_trailing_zeros.py #12033 → Updated docs for bit manipluation #13984 rebases last.

[cclauss]

@priya-sundaram-dev, in the Files not present in the working directory section above, can you please review the Physics pull requests and provide a list of ready-to-merge PRs?

[priya-sundaram-dev]

Done — here's my triage of the Physics PRs from the "Files not present in the working directory" section. For each I checked: CI status, whether it's a new file that doesn't collide with an existing physics/*.py, and whether it meets our bar (doctests + type hints). Merge order suggested at the end.

✅ Ready to merge (CI green, new file, doctests + type hints, no conflicts)

PR	File	Notes
#13343	first_law_of_thermodynamics.py	Strongest of the batch — thorough docstring, 5 typed functions, extensive doctests
#13341	magnetic_flux.py	10 doctests, typed, validation
#13342	faraday_lenz_law.py	8 doctests, typed
#14432	relativistic_kinetic_energy.py	typed + validation doctests
#14623	snells_law.py	typed, doctests
#14357	relativistic_velocity_summation.py	typed + ValueError doctests. Minor nit: header is # comments; converting to a module-level docstring would match house style, but not a blocker

🔁 Duplicates — pick one, close the rest

Three PRs all create physics/hookes_law.py: #13323, #13487, #14437.

• Add Hooke's Law implementation to physics #14437 is the best — full param/return docstring, input validation with ValueError doctests. Recommend merge Add Hooke's Law implementation to physics #14437 and close Added Hooke's Law #13323 and Hookes law #13487 as duplicates.

🔧 Needs changes before merge

• added collision detection between primitives like circle, rectangle e… #13002 (collision_detection.py) — no doctests and no type hints; would need both to meet the contribution bar.
• Add collisions #14787 (Add collisions) — this isn't a clean new-file add: it touches 2 files (+224/-32, modifies existing physics/potential_energy.py). Worth a closer standalone review rather than a quick merge.

⏳ Stale — CI hasn't run on the current head (needs a rebase/re-run before evaluating)

#9914 (boyles_law), #11744 (bragg_angle), #11580 (fresnel_diffract), #12686 (light_aberration), #12335 (rotational_partition), #12333 (translation_partition), #12129 (de_broglie). And #11608 (diffraction) is still a draft.

Suggested merge sequence: #13343 → #13341 → #13342 → #14432 → #14623 → #14357 → #14437 (then close #13323/#13487). These are all single-file, CI-green, non-conflicting adds, so order mostly just avoids surprises.

One caveat: I vetted structure/CI/dedup, not the physics of every formula — the ready-to-merge set all reference Wikipedia and have sane doctest values, but a quick sanity check on the constants wouldn't hurt.

[cclauss]

I performed the suggested merge sequence (including the module-level docstring). Thanks!

⏳ Stale — CI hasn't run on the current head (needs a rebase/re-run before evaluating)

#9914 (boyles_law), #11744 (bragg_angle), #11580 (fresnel_diffract), #12686 (light_aberration), #12335 (rotational_partition), #12333 (translation_partition), #12129 (de_broglie). And #11608 (diffraction) is still a draft.

I was able to resync all but #9914. Please re-review.

[priya-sundaram-dev]

Re-reviewed the resynced Physics PRs. CI status on current heads:

Ready to merge (CI green now):

• Create bragg_angle.py #11744 (bragg_angle) — green
• Add physics script for the light aberration calculation. #12686 (light_aberration) — green
• Create rotational_partition #12335 (rotational_partition) — green
• Create translation_partition #12333 (translation_partition) — green
• Create de_broglie #12129 (de_broglie) — green

They add distinct new files (plus the usual auto-regenerated DIRECTORY.md), so no real collisions between them.

Still red — needs one small fix:

• Add Algorithm for Fresnel Diffraction #11580 (fresnel_diffract) — build fails on a single doctest. The fresnel_diffract docstring has one example (around line 79) written as np.isclose(...) expecting True, but under NumPy 2.x that reprs as np.True_. The sibling examples at lines 74 and 126 already wrap it as bool(np.isclose(...)) — line 79 just needs the same bool() wrapper. Once that's added it should go green.

Not re-review-able:

• feat: ✨ Implementation of Boyle's law #9914 (boyles_law) — still on the old head (couldn't be resynced), so CI hasn't run.
• finding different diffraction parameters #11608 (diffraction) — still a draft.

[cclauss]

@priya-sundaram-dev, in the Files not present in the working directory section above, can you please review the machine_learning and then maths pull requests and provide a list of ready-to-merge PRs?

[priya-sundaram-dev]

Reviewed the machine_learning and maths PRs from the Files not present in the working directory section (53 PRs). Triage is by current-head CI status + filename collisions from the map:

✅ CI green now, distinct new file — ready to merge:
#10466, #12875, #13026, #13055, #13085, #13402, #13426, #13527, #13528, #13529, #13535, #13588, #13603, #13623, #13631, #13637, #13648, #13815, #13990, #13991, #13993, #14001, #14065, #14099, #14229, #14554, #14633, #14634, #14652, #14665, #14724, #14733, #14740, #14812, #14858, #14895, #14997

⚠️ Green but pick one (same target file):

• machine_learning/dbscan.py — Implementation of Density-based spatial clustering of applications with noise (DBSCAN) ML Algorithm #11671 (green, but mergeable=blocked pending an approval) vs Add DBSCAN clustering algorithm in machine_learning/ #14851 (green). Merge one, close/redirect the other.

🕓 Stale — CI hasn't run on current head (needs rebase/re-run before evaluating):
#10800, #11463, #11509, #12668, #12784, #13270, #13271, #13273 — plus the ridge_regression.py cluster #12111 & #12246 (both stale; also collide with #14016).

❌ Currently red:
#9610 (2 failing), #9619 (1 failing), #14016 (1 failing; ridge_regression.py collision).

One content caveat: #12976 (k_means_plus_plus) is CI-green but I left an open COMMENTED review with real gaps — empty-cluster NaN centroids masked by a module-level warnings.filterwarnings("ignore"), plus missing doctests/type hints. Worth resolving before merge even though CI passes.

This is CI+collision triage, not a deep code review of each — happy to dig into any specific PR you want to prioritize.

[cclauss]

@priya-sundaram-dev I have updated the following PRs, so please revisit them:

🕓 Stale — CI hasn't run on the current head (needs rebase/re-run before evaluating):
#10800, #11463, #11509, #12668, #12784, #13270, #13271, #13273 — plus the ridge_regression.py cluster #12111 & #12246 (both stale; also collide with #14016).

---

In the Files not present in the working directory section above, please review the pull requests in the following directories and provide a list of ready-to-merge PRs.
backtracking, bit_manipulation, blockchain, boolean_algebra, ciphers, conversions

[priya-sundaram-dev]

Thanks @cclauss — ran the file-map PRs in those six directories through a mechanical triage (CI rollup + mergeable_state conflict check + collision cross-ref against the map above). Scope note: this verifies each PR is mechanically ready (green CI, no merge conflicts, blocked only on the required-review gate); it does not vouch for algorithmic novelty/duplication, which still needs a human pass. I spot-checked several diffs and flagged what I found.

✅ Green CI + no conflicts (blocked only on required review)

• backtracking: fix(backtracking): Correct doctest in m_coloring_problem #13288
• bit_manipulation: feat: add count_bits algorithm with doctests #13938, Add divide two integers algorithm #13737, Add algorithm to find Two unique numbers using bit manipulation with docsets #13216, Add function to find upper and lower nibbles with doctests and type hints #13121, Added Implementation of Bit_Trie for finding max xor between two numbers in an array #13132, Add Sliding_Window_XOR working solution #13129, Add XOR-based swap algorithm for two numbers #13018
• blockchain: Add Merkle Tree construction and verification algorithm #13753, Add simple blockchain mining algorithm with PoW #13114, Add: blockchain/simple_proof_of_work.py #14237
• ciphers: Implement modified vigenere cipher for all printable ASCII #13452, feat: Add RC4 stream cipher implementation #14753, Add XTEA block cipher implementation #14414 — plus the skytale pair below
• conversions: Add binary to gray code conversion algorithm #13826, feat(conversions): Add Binary and Gray Code conversion algorithms #13634, Add endianness conversion algorithm #14041

⚠️ Ready but needs a small fix / decision first

• Created bianry_to_excessthree.py  #13831 (conversions/bianry_to_excessthree.py) — filename typo bianry → binary; ask for a rename before merge.
• (ciphers): add scytale (skytale) transposition cipher with doctests #13100 vs Feat/ciphers columnar #13102 — both create ciphers/skytale_cipher.py (they collide per the map). Feat/ciphers columnar #13102 also adds columnar_transposition.py. Pick one for skytale; Feat/ciphers columnar #13102 can still land its columnar file.

🕓 Stale — CI hasn't run on current head (need rebase/re-run before evaluating)

• bit_manipulation: Binary Addition of two binary strings input to produce binary string output of any length #10370, feat: Introduce hamming code generator #11827, Adding multibit-manipulation algorithm implemented with bitwise operations #11418, Single Number Algo Added #12042, added program to update bit at given position. #9902
• blockchain: Proof of Work Algorithm for Blockchain #11699, Added Proof of Stake(PoS) #11945, New: Added proof of work(PoW) #11946
• ciphers: Added Base58 encoding/decoding in ciphers #12123, [Feature] Implemented DES Algorithm in ECB mode #11785
• conversions: Added base64 to binary conversion. #12209, Added binary to base64 conversion #12210, Create convert_base.py #11115, feat: implements a hex to rgb conversion function #11113, adding negative binary base conversion algorithms #11213, Add ounces to grams conversion. #14079

❌ Failing CI

• Create spiral_transposition.py #13421 (ciphers/spiral_transposition.py) — red checks; needs author fix.

Happy to take the next batch of directories (data_structures, dynamic_programming, graphs, maths, sorts, strings) the same way if that's useful.

[priya-sundaram-dev]

Re-checked the PRs you updated (same mechanical pass — mergeable_state + current-head CI rollup). Unfortunately the base-branch update left most of them with merge conflicts, so they need an author rebase before they can be evaluated:

🔀 Green CI but now conflicting (dirty) — need a rebase first

• The sum of outcomes for rolling an N-sided dice K times. #11463 (dice roll sum), Add ml algorithms #13270 (Add ml algorithms), Add cnn model #13273 (Add cnn model) — checks pass, but each now conflicts with main.

❌ Still red after the update

• Add algorithm for approximating the nth root with Newton's Method #11509 — ruff failing (+ conflicting)
• Added kernel svm algorithm code file #12784 — ruff and build failing (+ conflicting)
• Add ARIMA model #13271 (ARIMA) — build failing (+ conflicting)

🕓 No checks on current head yet

• added multi armed bandit problem with three strategies to solve it #12668, Add: Ordinary Least Squares Regression Algorithm #10800 — CI hasn't reported on the latest head; mergeable_state still recomputing. Worth a re-run once GitHub settles.

ridge_regression.py cluster

• Add Ridge Regression to Machine Learning #12111 — conflicting, no checks on head.
• Add Ridge Regression to Machine Learning #12246 — conflicting, ruff failing.
• machine_learning: add RidgeRegression with tests and demo #14016 — this is the only one blocked only on review (mergeable_state: blocked), but its build check is failing, so it isn't mergeable as-is.

Net: nothing in this batch is merge-ready right now — the conflicts and the three ruff/build failures need author action first. Happy to re-run this the moment any of them get rebased. Scope caveat as before: this is mechanical readiness (CI + conflicts), not a vouch for algorithmic novelty.

[cclauss]

@priya-sundaram-dev Can you look at the three contested files and pick the best PR to merge for each? We are running out of time before our October 1 Hacktoberfest deadline, so I will merge only one PR per file and close all the others. If you need any rebases done or tests rerun, please let me know.

• searches/binary_search.py (11 PRs): Remove inefficient validation checks in binary search functions #13836 Fixes #13840 - handle duplicate items correctly in binary search #13841 Fix binary search to return leftmost occurrence for duplicates #13891 fixed logical error in parameter "hi" the bisect functions of the bin… #13900 Fix: return the correct index when duplicates in binary_search #13901 Fix: Return first index for binary search with duplicate elements (#1… #13955 Clarify doctest usage in binary search docstring #14051 Improve binary search doc #14456 Fix binary search final #14523 Improve error message clarity in binary search functions #14622 added time complexity to binary_search.py docstring #14708
• machine_learning/linear_regression.py (4 PRs): Update linear_regression.py #11567 Contributes to #9943 by add tests in linear regression #11622 Added Exception Handling and type hinting #11802 Add regression visualization #14637
• machine_learning/loss_functions.py (4 PRs): Add connectionist temporal classification (CTC) loss algorithm #11240 Add the sparse categorical cross-entropy loss #11250 Add Gaussian negative log likelihood loss algorithm #11263 Adding RMSE - Root Mean Squared Error Loss function #13410

[priya-sundaram-dev]

@cclauss Went through all three contested files — for each I ran the current-head CI rollup, checked mergeable, and read the diffs against CONTRIBUTING.md and the file's existing conventions. My pick + reasoning per file, plus what to do with the rest:

searches/binary_search.py → merge #13891, close the rest

Most of these 11 are two ideas: "return the leftmost index for duplicates" (#13841, #13891, #13901, #13955), and doc/message-only tweaks (#14051, #14622, #14708, #14456).

• Fix binary search to return leftmost occurrence for duplicates #13891 (recommended) implements leftmost-for-duplicates the right way: O(log n) (result = midpoint; right = midpoint - 1), updates the :return: docstrings, adds doctests, and applies it consistently to both binary_search and binary_search_by_recursion (clean recursive helper). Mergeable, CI green.
• Fix: return the correct index when duplicates in binary_search #13901 — same core idea but only patches binary_search (leaves the recursive/std_lib variants returning a different index for duplicates), and adds no doctests. Inconsistent.
• Fixes #13840 - handle duplicate items correctly in binary search #13841 — finds leftmost with a linear back-scan (while ... sorted_collection[midpoint-1] == item), i.e. O(log n + k) worst-case O(n); also does a messy rewrite of the recursion's sorted-check. Algorithmically weaker than Fix binary search to return leftmost occurrence for duplicates #13891.
• Fix: Return first index for binary search with duplicate elements (#1… #13955 conflicting; Improve binary search doc #14456 is red (ruff) and a 215/-222 churn; Fix binary search final #14523 touches 2 files (off-convention); fixed logical error in parameter "hi" the bisect functions of the bin… #13900 is a different fix (negative-hi indexing in bisect_left/right) with a typo'd comment and no doctest; Clarify doctest usage in binary search docstring #14051/Improve error message clarity in binary search functions #14622/added time complexity to binary_search.py docstring #14708 are doc/message-only.

One judgment call for you: #13891 changes search semantics (returns leftmost occurrence, presumably per #13840). If you'd rather not change the contract, the safe low-risk alternative is the doc-only #14708 (adds time-complexity to the docstring). But if #13840 is the driver, #13891 is the one to take.

machine_learning/loss_functions.py → merge #11250, but don't hard-close #11240/#11263

These don't actually collide semantically — they each append a new loss function; the conflict is purely textual (same file tail).

• Add the sparse categorical cross-entropy loss #11250 (recommended) — sparse_categorical_cross_entropy, a standard, widely-used complement to the existing categorical_cross_entropy. Clean, Wikipedia reference, doctests including the error path.
• Worth inviting to rebase rather than closing: Add connectionist temporal classification (CTC) loss algorithm #11240 (CTC loss) and Add Gaussian negative log likelihood loss algorithm #11263 (gaussian_negative_log_likelihood) are genuinely distinct, non-duplicate additions from the same author — closing them loses real content. If you merge Add the sparse categorical cross-entropy loss #11250 first, the other two just need a rebase to land in sequence.
• Adding RMSE - Root Mean Squared Error Loss function #13410 (root_mean_squared_error) is borderline: it's literally sqrt(mean_squared_error) which already exists at line 333, and it type-hints with np.array instead of the file's np.ndarray. I'd rank it last.

Heads-up: the three 2024 PRs show no CI history (predate the current CI), so they'll each need a rebase + a CI rerun to confirm the doctests — the >>> outputs look right on read, but I'd want them green before merge.

machine_learning/linear_regression.py → #14637 with two requested changes

This file was migrated from requests to httpx since 2024, which decides most of it:

• Update linear_regression.py #11567, Contributes to #9943 by add tests in linear regression #11622, Added Exception Handling and type hinting #11802 all predate that migration and still import requests, so they'd need a substantial rebase. Added Exception Handling and type hinting #11802 additionally type-hints with the deprecated np.matrix and reaches into a private numpy API (np.core._exception._ArrayMemoryError), and has a duplicated docstring block — I'd not take it as-is.
• Add regression visualization #14637 is the only candidate built on the current httpx master with green CI. But before merge it needs: (1) it changes run_linear_regression's return from theta to (theta, err) — a breaking change to the public function; please keep it backward-compatible or update the callers/__main__; and (2) plot_regression/plot_loss have no doctests and call plt.show() directly — fine as viz helpers, but they should be exercised from the __main__ guard rather than left dead.

If you take my picks, the ones I'd love a CI rerun on are #11250 and #13891 (both should be green, but they're worth confirming before you merge). Happy to do the rebases on #13891/#11250/#14637 myself if that helps clear them faster before Oct 1.