Merge branch 'TheAlgorithms:master' into master

Author: pdadhikary

.github/workflows/sphinx.yml

@@ -39,7 +39,7 @@ jobs:
           python-version: 3.14
           allow-prereleases: true
       - run: uv sync --group=docs
-      - uses: actions/configure-pages@v5
+      - uses: actions/configure-pages@v6
       - run: uv run sphinx-build -c docs . docs/_build/html
       - uses: actions/upload-pages-artifact@v4
         with:
@@ -53,5 +53,5 @@ jobs:
     needs: build_docs
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/deploy-pages@v4
+      - uses: actions/deploy-pages@v5
         id: deployment

.pre-commit-config.yaml

@@ -14,12 +14,12 @@ repos:
       - id: requirements-txt-fixer
 
   - repo: https://github.com/MarcoGorelli/auto-walrus
-    rev: 0.3.4
+    rev: 0.4.1
     hooks:
       - id: auto-walrus
 
   - repo: https://github.com/astral-sh/ruff-pre-commit
-    rev: v0.14.10
+    rev: v0.14.14
     hooks:
       - id: ruff-check
       - id: ruff-format
@@ -32,7 +32,7 @@ repos:
           - tomli
 
   - repo: https://github.com/tox-dev/pyproject-fmt
-    rev: v2.11.1
+    rev: v2.12.1
     hooks:
       - id: pyproject-fmt
 

CONTRIBUTING.md

@@ -159,7 +159,7 @@ We want your work to be readable by others; therefore, we encourage you to note
   starting_value = int(input("Please enter a starting value: ").strip())
   ```
 
-  The use of [Python type hints](https://docs.python.org/3/library/typing.html) is encouraged for function parameters and return values.  Our automated testing will run [mypy](http://mypy-lang.org) so run that locally before making your submission.
+  The use of [Python type hints](https://docs.python.org/3/library/typing.html) is encouraged for function parameters and return values.  Our automated testing will run [mypy](https://mypy-lang.org) so run that locally before making your submission.
 
   ```python
   def sum_ab(a: int, b: int) -> int:

DIRECTORY.md

@@ -469,6 +469,11 @@
 
 ## Geometry
   * [Geometry](geometry/geometry.py)
+  * [Graham Scan](geometry/graham_scan.py)
+  * [Jarvis March](geometry/jarvis_march.py)
+  * Tests
+    * [Test Graham Scan](geometry/tests/test_graham_scan.py)
+    * [Test Jarvis March](geometry/tests/test_jarvis_march.py)
 
 ## Graphics
   * [Bezier Curve](graphics/bezier_curve.py)
@@ -881,6 +886,7 @@
   * [Quine](other/quine.py)
   * [Scoring Algorithm](other/scoring_algorithm.py)
   * [Sdes](other/sdes.py)
+  * [Sliding Window Maximum](other/sliding_window_maximum.py)
   * [Tower Of Hanoi](other/tower_of_hanoi.py)
   * [Word Search](other/word_search.py)
 
@@ -980,6 +986,7 @@
     * [Sol2](project_euler/problem_014/sol2.py)
   * Problem 015
     * [Sol1](project_euler/problem_015/sol1.py)
+    * [Sol2](project_euler/problem_015/sol2.py)
   * Problem 016
     * [Sol1](project_euler/problem_016/sol1.py)
     * [Sol2](project_euler/problem_016/sol2.py)

backtracking/coloring.py

@@ -104,6 +104,14 @@ def color(graph: list[list[int]], max_colors: int) -> list[int]:
     >>> max_colors = 2
     >>> color(graph, max_colors)
     []
+    >>> color([], 2)  # empty graph
+    []
+    >>> color([[0]], 1)  # single node, 1 color
+    [0]
+    >>> color([[0, 1], [1, 0]], 1)  # 2 nodes, 1 color (impossible)
+    []
+    >>> color([[0, 1], [1, 0]], 2)  # 2 nodes, 2 colors (possible)
+    [0, 1]
     """
     colored_vertices = [-1] * len(graph)
 

backtracking/generate_parentheses.py

@@ -64,6 +64,10 @@ def generate_parenthesis(n: int) -> list[str]:
     Example 2:
     >>> generate_parenthesis(1)
     ['()']
+
+    Example 3:
+    >>> generate_parenthesis(0)
+    ['']
     """
 
     result: list[str] = []

backtracking/generate_parentheses_iterative.py

@@ -1,11 +1,12 @@
-def generate_parentheses_iterative(length: int) -> list:
+def generate_parentheses_iterative(length: int) -> list[str]:
     """
     Generate all valid combinations of parentheses (Iterative Approach).
 
     The algorithm works as follows:
     1. Initialize an empty list to store the combinations.
     2. Initialize a stack to keep track of partial combinations.
-    3. Start with empty string and push it onstack along with the counts of '(' and ')'.
+    3. Start with empty string and push it on stack along with
+       the counts of '(' and ')'.
     4. While the stack is not empty:
         a. Pop a partial combination and its open and close counts from the stack.
         b. If the combination length is equal to 2*length, add it to the result.
@@ -34,8 +35,11 @@ def generate_parentheses_iterative(length: int) -> list:
     >>> generate_parentheses_iterative(0)
     ['']
     """
-    result = []
-    stack = []
+    if length == 0:
+        return [""]
+
+    result: list[str] = []
+    stack: list[tuple[str, int, int]] = []
 
     # Each element in stack is a tuple (current_combination, open_count, close_count)
     stack.append(("", 0, 0))
@@ -45,6 +49,7 @@ def generate_parentheses_iterative(length: int) -> list:
 
         if len(current_combination) == 2 * length:
             result.append(current_combination)
+            continue
 
         if open_count < length:
             stack.append((current_combination + "(", open_count + 1, close_count))

backtracking/n_queens.py

@@ -33,6 +33,14 @@ def is_safe(board: list[list[int]], row: int, column: int) -> bool:
     False
     >>> is_safe([[0, 0, 1], [0, 0, 0], [0, 0, 0]], 1, 1)
     False
+    >>> is_safe([[1, 0, 0], [0, 0, 0], [0, 0, 0]], 1, 2)
+    True
+    >>> is_safe([[1, 0, 0], [0, 0, 0], [0, 0, 0]], 2, 1)
+    True
+    >>> is_safe([[0, 0, 0], [1, 0, 0], [0, 0, 0]], 0, 2)
+    True
+    >>> is_safe([[0, 0, 0], [1, 0, 0], [0, 0, 0]], 2, 2)
+    True
     """
 
     n = len(board)  # Size of the board

backtracking/word_break.py

@@ -66,6 +66,9 @@ def word_break(input_string: str, word_dict: set[str]) -> bool:
 
     >>> word_break("catsandog", {"cats", "dog", "sand", "and", "cat"})
     False
+
+    >>> word_break("applepenapple", {})
+    False
     """
 
     return backtrack(input_string, word_dict, 0)

data_structures/hashing/hash_table_with_linked_list.py

@@ -8,7 +8,7 @@ def __init__(self, *args, **kwargs):
         super().__init__(*args, **kwargs)
 
     def _set_value(self, key, data):
-        self.values[key] = deque([]) if self.values[key] is None else self.values[key]
+        self.values[key] = deque() if self.values[key] is None else self.values[key]
         self.values[key].appendleft(data)
         self._keys[key] = self.values[key]