Merge branch 'master' into diffraction

Author: Skywalkr-dev

.devcontainer/devcontainer.json

@@ -9,12 +9,12 @@
 	//
 	// This repo tracks the latest-and-greatest CPython on the newest stable
 	// Debian. Images are published per CPython minor version on Debian 13
-	// "Trixie" (3.11-trixie ... 3.14-trixie); bump this to the newest available
+	// "Trixie" (3.11-trixie ... 3.15-trixie); bump this to the newest available
 	// when a new stable CPython ships.
-	// NOTE: these images do not publish free-threaded (`t`) variants, so 3.14t
+	// NOTE: these images do not publish free-threaded (`t`) variants, so 3.15t
 	// cannot be selected via the tag alone -- but the repo's `.python-version`
-	// pins 3.14t, and `uv run`/`uv sync` in the container honor it, so uv gives
-	// contributors free-threaded 3.14t regardless of the base tag.
+	// pins 3.15t, and `uv run`/`uv sync` in the container honor it, so uv gives
+	// contributors free-threaded 3.15t regardless of the base tag.
 	"image": "mcr.microsoft.com/devcontainers/python:latest",
 
 	// Install the tools post_install and CI expect (pre-commit + ruff), plus uv

.github/workflows/build.yml

@@ -20,39 +20,26 @@ jobs:
         with:
           python-version-file: .python-version
           allow-prereleases: true
-      # keras needs hdf5 on pre-release Python.
-      - run: |
-          if [ "$(python -c 'import sys; print(sys.version_info.releaselevel)')" != "final" ]; then
-            sudo apt-get update -qq
-            sudo apt-get install --yes libhdf5-dev
-          fi
       - run: uv sync --group=test
       - name: Run tests
-        # opencv-python is gated out on 3.14t (no cp314t wheel yet), so skip the
+        # opencv-python is gated out on 3.15t (no cp315t wheel yet), so skip the
         # files that import cv2. Pure-Python algorithms in computer_vision/ and
         # data_compression/ still run; digital_image_processing/ is almost entirely
-        # cv2-based so it is skipped as a tree. Re-enable when a cp314t wheel ships.
+        # cv2-based so it is skipped as a tree. Re-enable when a cp315t wheel ships.
         # --ignore-gil-enabled: some compiled deps (sklearn, xgboost, ...) don't
         # yet ship the Py_mod_gil slot, so importing them re-enables the GIL under
-        # 3.14t. That's an upstream-wheel gap, not our code; the flag lets the suite
+        # 3.15t. That's an upstream-wheel gap, not our code; the flag lets the suite
         # run anyway and pytest-run-parallel still reports which tests are not
         # thread-safe. Drop the flag once the scientific stack ships free-threaded wheels.
-        # qiskit is likewise gated out of the 3.14t deps (Qiskit/qiskit#16893), so the
-        # single file that imports it (quantum/q_fourier_transform.py) is skipped too.
         run: uv run --with=pytest-run-parallel pytest
           --iterations=8 --parallel-threads=auto --ignore-gil-enabled
-          --ignore=computer_vision/cnn_classification.py
           --ignore=computer_vision/flip_augmentation.py
           --ignore=computer_vision/harris_corner.py
           --ignore=computer_vision/mosaic_augmentation.py
           --ignore=data_compression/peak_signal_to_noise_ratio.py
           --ignore=digital_image_processing/
           --ignore=docs/conf.py
-          --ignore=dynamic_programming/k_means_clustering_tensorflow.py
-          --ignore=machine_learning/lstm/lstm_prediction.py
-          --ignore=neural_network/input_data.py
           --ignore=project_euler/
-          --ignore=quantum/q_fourier_transform.py
           --ignore=scripts/validate_solutions.py
           --ignore=web_programming/current_stock_price.py
           --ignore=web_programming/fetch_anime_and_play.py

.github/workflows/sphinx.yml

@@ -33,12 +33,6 @@ jobs:
         with:
           python-version-file: .python-version
           allow-prereleases: true
-      # keras needs hdf5 on pre-release Python.
-      - run: |
-          if [ "$(python -c 'import sys; print(sys.version_info.releaselevel)')" != "final" ]; then
-            sudo apt-get update -qq
-            sudo apt-get install --yes libhdf5-dev
-          fi
       - run: uv sync --group=docs
       - uses: actions/configure-pages@v6
       - run: uv run sphinx-build -c docs . docs/_build/html

.github/workflows/ty.yml

@@ -28,16 +28,16 @@ jobs:
       # [build-system], so uv treats the project as virtual and installs only
       # its dependencies -- no "Multiple top-level packages discovered in a
       # flat-layout" error and no need for a src-layout. (`uv pip install .`
-      # would force that wheel build and fail.) Pin a regular GIL 3.14 so typed
-      # third-party dependencies resolve; the free-threaded 3.14t interpreter the
+      # would force that wheel build and fail.) Pin a regular GIL 3.15 so typed
+      # third-party dependencies resolve; the free-threaded 3.15t interpreter the
       # test matrix uses lacks wheels for several of them. ty itself is pulled in
       # ephemerally with `--with` so it needn't be added to the lockfile.
-      - run: uv sync --python 3.14
-      # Pin the *run* to the same regular-GIL 3.14 too. Without `--python 3.14`
+      - run: uv sync --python 3.15
+      # Pin the *run* to the same regular-GIL 3.15 too. Without `--python 3.15`
       # here, `uv run` re-resolved the project's default interpreter -- the
-      # free-threaded 3.14t used by the test matrix -- so ty type-checked against
+      # free-threaded 3.15t used by the test matrix -- so ty type-checked against
       # an env where many third-party stubs don't resolve, drowning real findings
-      # in `unresolved-import` / `unresolved-attribute` noise. Pinning 3.14 lets
+      # in `unresolved-import` / `unresolved-attribute` noise. Pinning 3.15 lets
       # ty see the synced dependencies, so the `[tool.ty.rules]` severities in
       # pyproject.toml apply to a meaningful baseline.
       #
@@ -50,4 +50,4 @@ jobs:
       # to make ty a required gate once the [tool.ty] baseline is clean.
       # `continue-on-error: true` above stays as a belt-and-suspenders guard so a
       # ty *crash* (not a diagnostic) can never block a merge either.
-      - run: uv run --python 3.14 --with ty ty check --output-format=github --exit-zero
+      - run: uv run --python 3.15 --with ty ty check --output-format=github --exit-zero

.python-version

@@ -1 +1 @@
-3.14t
+3.15t

CONTRIBUTING.md

@@ -100,7 +100,7 @@ pre-commit run --all-files --show-diff-on-failure
 
 We want your work to be readable by others; therefore, we encourage you to note the following:
 
-- Please write in free-threaded Python 3.14t+. For instance: `print()` is a function in Python 3, so `print "Hello"` will *not* work, but `print("Hello")` will.
+- Please write in free-threaded Python 3.15t+. For instance: `print()` is a function in Python 3, so `print "Hello"` will *not* work, but `print("Hello")` will.
 
 - Please focus hard on the naming of functions, classes, and variables. Help your reader by using __descriptive names__ that can help you to remove redundant comments.
   - Single-letter variable names are *old school*, so please avoid them unless their life only spans a few lines.

DIRECTORY.md

@@ -106,6 +106,7 @@
   * [Rotate Bits](bit_manipulation/rotate_bits.py)
   * [Single Bit Manipulation Operations](bit_manipulation/single_bit_manipulation_operations.py)
   * [Swap All Odd And Even Bits](bit_manipulation/swap_all_odd_and_even_bits.py)
+  * [Xor Swap Two Integers](bit_manipulation/xor_swap_two_integers.py)
 
 ## [Blockchain](blockchain)
   * [Diophantine Equation](blockchain/diophantine_equation.py)
@@ -194,7 +195,6 @@
   * [Xtea](ciphers/xtea.py)
 
 ## [Computer Vision](computer_vision)
-  * [Cnn Classification](computer_vision/cnn_classification.py)
   * [Flip Augmentation](computer_vision/flip_augmentation.py)
   * [Gramian](computer_vision/gramian.py)
   * [Haralick Descriptors](computer_vision/haralick_descriptors.py)
@@ -262,18 +262,24 @@
 
 ## [Data Structures](data_structures)
   * Arrays
+    * [Dynamic Array](data_structures/arrays/dynamic_array.py)
     * [Equilibrium Index In Array](data_structures/arrays/equilibrium_index_in_array.py)
     * [Find Triplets With 0 Sum](data_structures/arrays/find_triplets_with_0_sum.py)
+    * [Gas Station](data_structures/arrays/gas_station.py)
     * [Index 2D Array In 1D](data_structures/arrays/index_2d_array_in_1d.py)
     * [Kth Largest Element](data_structures/arrays/kth_largest_element.py)
     * [Median Two Array](data_structures/arrays/median_two_array.py)
+    * [Merge Intervals](data_structures/arrays/merge_intervals.py)
+    * [Merge Sorted](data_structures/arrays/merge_sorted.py)
     * [Monotonic Array](data_structures/arrays/monotonic_array.py)
     * [Pairs With Given Sum](data_structures/arrays/pairs_with_given_sum.py)
     * [Pairwise Iteration](data_structures/arrays/pairwise_iteration.py)
     * [Permutations](data_structures/arrays/permutations.py)
     * [Prefix Sum](data_structures/arrays/prefix_sum.py)
     * [Product Sum](data_structures/arrays/product_sum.py)
+    * [Reverse Array](data_structures/arrays/reverse_array.py)
     * [Rotate Array](data_structures/arrays/rotate_array.py)
+    * [Set Matrix Zeroes](data_structures/arrays/set_matrix_zeroes.py)
     * [Sparse Table](data_structures/arrays/sparse_table.py)
     * [Sudoku Solver](data_structures/arrays/sudoku_solver.py)
   * Binary Tree
@@ -303,6 +309,7 @@
     * [Mirror Binary Tree](data_structures/binary_tree/mirror_binary_tree.py)
     * [Non Recursive Segment Tree](data_structures/binary_tree/non_recursive_segment_tree.py)
     * [Number Of Possible Binary Trees](data_structures/binary_tree/number_of_possible_binary_trees.py)
+    * [Persistent Segment Tree](data_structures/binary_tree/persistent_segment_tree.py)
     * [Red Black Tree](data_structures/binary_tree/red_black_tree.py)
     * [Segment Tree](data_structures/binary_tree/segment_tree.py)
     * [Segment Tree Other](data_structures/binary_tree/segment_tree_other.py)
@@ -470,7 +477,6 @@
   * [Floyd Warshall](dynamic_programming/floyd_warshall.py)
   * [Integer Partition](dynamic_programming/integer_partition.py)
   * [Iterating Through Submasks](dynamic_programming/iterating_through_submasks.py)
-  * [K Means Clustering Tensorflow](dynamic_programming/k_means_clustering_tensorflow.py)
   * [Knapsack](dynamic_programming/knapsack.py)
   * [Largest Divisible Subset](dynamic_programming/largest_divisible_subset.py)
   * [Longest Common Subsequence](dynamic_programming/longest_common_subsequence.py)
@@ -479,6 +485,7 @@
   * [Longest Increasing Subsequence Iterative](dynamic_programming/longest_increasing_subsequence_iterative.py)
   * [Longest Increasing Subsequence O Nlogn](dynamic_programming/longest_increasing_subsequence_o_nlogn.py)
   * [Longest Palindromic Subsequence](dynamic_programming/longest_palindromic_subsequence.py)
+  * [Longest Repeating Subsequence](dynamic_programming/longest_repeating_subsequence.py)
   * [Matrix Chain Multiplication](dynamic_programming/matrix_chain_multiplication.py)
   * [Matrix Chain Order](dynamic_programming/matrix_chain_order.py)
   * [Max Non Adjacent Sum](dynamic_programming/max_non_adjacent_sum.py)
@@ -540,12 +547,15 @@
     * [Test Send File](file_transfer/tests/test_send_file.py)
 
 ## [Financial](financial)
+  * [Annuity Due Future Value](financial/annuity_due_future_value.py)
   * [Equated Monthly Installments](financial/equated_monthly_installments.py)
   * [Expected Shortfall](financial/expected_shortfall.py)
   * [Exponential Moving Average](financial/exponential_moving_average.py)
+  * [Fractional Differentiation](financial/fractional_differentiation.py)
   * [Interest](financial/interest.py)
   * [Kelly Criterion](financial/kelly_criterion.py)
   * [Macaulay Duration](financial/macaulay_duration.py)
+  * [Ordinary Annuity Future Value](financial/ordinary_annuity_future_value.py)
   * [Present Value](financial/present_value.py)
   * [Price Plus Tax](financial/price_plus_tax.py)
   * [Sharpe Ratio](financial/sharpe_ratio.py)
@@ -629,6 +639,7 @@
   * [Dijkstra Binary Grid](graphs/dijkstra_binary_grid.py)
   * [Dinic](graphs/dinic.py)
   * [Directed And Undirected Weighted Graph](graphs/directed_and_undirected_weighted_graph.py)
+  * [Edmonds Blossom Algorithm](graphs/edmonds_blossom_algorithm.py)
   * [Edmonds Karp Multiple Source And Sink](graphs/edmonds_karp_multiple_source_and_sink.py)
   * [Eulerian Path And Circuit For Undirected Graph](graphs/eulerian_path_and_circuit_for_undirected_graph.py)
   * [Even Tree](graphs/even_tree.py)
@@ -638,7 +649,9 @@
   * [Gale Shapley Bigraph](graphs/gale_shapley_bigraph.py)
   * [Graph Adjacency List](graphs/graph_adjacency_list.py)
   * [Graph Adjacency Matrix](graphs/graph_adjacency_matrix.py)
+  * [Graph Centrality](graphs/graph_centrality.py)
   * [Graph List](graphs/graph_list.py)
+  * [Graph Peripherality](graphs/graph_peripherality.py)
   * [Graphs Floyd Warshall](graphs/graphs_floyd_warshall.py)
   * [Greedy Best First](graphs/greedy_best_first.py)
   * [Greedy Min Vertex Cover](graphs/greedy_min_vertex_cover.py)
@@ -664,13 +677,15 @@
   * [Strongly Connected Components](graphs/strongly_connected_components.py)
   * [Tarjans Scc](graphs/tarjans_scc.py)
   * Tests
+    * [Test Edmonds Blossom Algorithm](graphs/tests/test_edmonds_blossom_algorithm.py)
     * [Test Graphs Floyd Warshall](graphs/tests/test_graphs_floyd_warshall.py)
     * [Test Johnson](graphs/tests/test_johnson.py)
     * [Test Min Spanning Tree Kruskal](graphs/tests/test_min_spanning_tree_kruskal.py)
     * [Test Min Spanning Tree Prim](graphs/tests/test_min_spanning_tree_prim.py)
   * [Travelling Salesman Problem](graphs/travelling_salesman_problem.py)
 
 ## [Greedy Methods](greedy_methods)
+  * [Activity Selection](greedy_methods/activity_selection.py)
   * [Best Time To Buy And Sell Stock](greedy_methods/best_time_to_buy_and_sell_stock.py)
   * [Fractional Cover Problem](greedy_methods/fractional_cover_problem.py)
   * [Fractional Knapsack](greedy_methods/fractional_knapsack.py)
@@ -692,6 +707,7 @@
   * [Enigma Machine](hashes/enigma_machine.py)
   * [Fletcher16](hashes/fletcher16.py)
   * [Hamming Code](hashes/hamming_code.py)
+  * [Jenkins One At A Time](hashes/jenkins_one_at_a_time.py)
   * [Luhn](hashes/luhn.py)
   * [Md5](hashes/md5.py)
   * [Sdbm](hashes/sdbm.py)
@@ -754,8 +770,6 @@
     * [Local Weighted Learning](machine_learning/local_weighted_learning/local_weighted_learning.py)
   * [Logistic Regression](machine_learning/logistic_regression.py)
   * [Loss Functions](machine_learning/loss_functions.py)
-  * Lstm
-    * [Lstm Prediction](machine_learning/lstm/lstm_prediction.py)
   * [Mab](machine_learning/mab.py)
   * [Mean Shift](machine_learning/mean_shift.py)
   * [Mfcc](machine_learning/mfcc.py)
@@ -885,6 +899,7 @@
     * [Nevilles Method](maths/numerical_analysis/nevilles_method.py)
     * [Newton Forward Interpolation](maths/numerical_analysis/newton_forward_interpolation.py)
     * [Newton Raphson](maths/numerical_analysis/newton_raphson.py)
+    * [Nth Root](maths/numerical_analysis/nth_root.py)
     * [Numerical Integration](maths/numerical_analysis/numerical_integration.py)
     * [Proper Fractions](maths/numerical_analysis/proper_fractions.py)
     * [Runge Kutta](maths/numerical_analysis/runge_kutta.py)
@@ -960,6 +975,7 @@
     * [Happy Number](maths/special_numbers/happy_number.py)
     * [Harshad Numbers](maths/special_numbers/harshad_numbers.py)
     * [Hexagonal Number](maths/special_numbers/hexagonal_number.py)
+    * [Jacobsthal Number](maths/special_numbers/jacobsthal_number.py)
     * [Kaprekar Constant](maths/special_numbers/kaprekar_constant.py)
     * [Kaprekar Number](maths/special_numbers/kaprekar_number.py)
     * [Krishnamurthy Number](maths/special_numbers/krishnamurthy_number.py)
@@ -1016,9 +1032,11 @@
   * [Rotate Matrix](matrix/rotate_matrix.py)
   * [Searching In Sorted Matrix](matrix/searching_in_sorted_matrix.py)
   * [Sherman Morrison](matrix/sherman_morrison.py)
+  * [Similar Matrices](matrix/similar_matrices.py)
   * [Spiral Print](matrix/spiral_print.py)
   * Tests
     * [Test Matrix Operation](matrix/tests/test_matrix_operation.py)
+  * [Transitive Closure](matrix/transitive_closure.py)
   * [Validate Sudoku Board](matrix/validate_sudoku_board.py)
 
 ## [Networking Flow](networking_flow)
@@ -1043,7 +1061,7 @@
     * [Swish](neural_network/activation_functions/swish.py)
   * [Back Propagation Neural Network](neural_network/back_propagation_neural_network.py)
   * [Convolution Neural Network](neural_network/convolution_neural_network.py)
-  * [Input Data](neural_network/input_data.py)
+  * [Lstm](neural_network/lstm.py)
   * Optimizers
     * [Adagrad](neural_network/optimizers/adagrad.py)
     * [Adam Optimizer](neural_network/optimizers/adam_optimizer.py)
@@ -1052,6 +1070,7 @@
     * [Nesterov Accelerated Sgd](neural_network/optimizers/nesterov_accelerated_sgd.py)
   * [Perceptron](neural_network/perceptron.py)
   * [Simple Neural Network](neural_network/simple_neural_network.py)
+  * [Sliding Window Attention](neural_network/sliding_window_attention.py)
   * [Two Hidden Layers Neural Network](neural_network/two_hidden_layers_neural_network.py)
 
 ## [Other](other)
@@ -1593,9 +1612,11 @@
   * [Knuth Morris Pratt](strings/knuth_morris_pratt.py)
   * [Largest Smallest Words](strings/largest_smallest_words.py)
   * [Levenshtein Distance](strings/levenshtein_distance.py)
+  * [Longest Word In Sentence](strings/longest_word_in_sentence.py)
   * [Lower](strings/lower.py)
   * [Manacher](strings/manacher.py)
   * [Min Cost String Conversion](strings/min_cost_string_conversion.py)
+  * [Min Window Substring](strings/min_window_substring.py)
   * [Naive String Search](strings/naive_string_search.py)
   * [Ngram](strings/ngram.py)
   * [Palindrome](strings/palindrome.py)
@@ -1607,6 +1628,7 @@
   * [Reverse Words](strings/reverse_words.py)
   * [Snake Case To Camel Pascal Case](strings/snake_case_to_camel_pascal_case.py)
   * [Split](strings/split.py)
+  * [String Is Valid Number](strings/string_is_valid_number.py)
   * [String Switch Case](strings/string_switch_case.py)
   * [Strip](strings/strip.py)
   * [Suffix Automaton](strings/suffix_automaton.py)

bit_manipulation/xor_swap_two_integers.py

@@ -0,0 +1,40 @@
+# Information on XOR swap: https://en.wikipedia.org/wiki/Bitwise_operation#XOR
+
+# Algorithm:
+# 1. Take two integers a and b.
+# 2. Apply XOR between a and b and store the result in a:
+#       a = a ^ b
+# 3. XOR the new value of a with b to get the original value of a and store it in b:
+#       b = a ^ b
+# 4. XOR the new value of a with the new value of b.
+#    This gives the original value of b, which we store in a:
+#       a = a ^ b
+# 5. Return the swapped values (a, b).
+# This method swaps two numbers without using a temporary variable.
+
+
+def xor_swap(a: int, b: int) -> tuple[int, int]:
+    """
+    Swap two integers using bitwise XOR operation and return the swapped values.
+
+    >>> xor_swap(5, 10)
+    (10, 5)
+    >>> xor_swap(0, 0)
+    (0, 0)
+    >>> xor_swap(-1, 1)
+    (1, -1)
+    >>> xor_swap(123, 456)
+    (456, 123)
+    >>> xor_swap(12345, 54321)
+    (54321, 12345)
+    """
+    a = a ^ b
+    b = a ^ b
+    a = a ^ b
+    return a, b
+
+
+if __name__ == "__main__":
+    import doctest
+
+    doctest.testmod()