Merge branch 'master' into ML

Mathasuriya-infy · web-flow · commit d215734df07c · 2026-04-16T17:26:37.000+05:30
diff --git a/.github/workflows/sphinx.yml b/.github/workflows/sphinx.yml
@@ -39,9 +39,9 @@ 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
+      - uses: actions/upload-pages-artifact@v5
         with:
           path: docs/_build/html
 
@@ -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
diff --git a/.pre-commit-config.yaml b/.pre-commit-config.yaml
@@ -19,20 +19,20 @@ repos:
       - id: auto-walrus
 
   - repo: https://github.com/astral-sh/ruff-pre-commit
-    rev: v0.14.14
+    rev: v0.15.9
     hooks:
       - id: ruff-check
       - id: ruff-format
 
   - repo: https://github.com/codespell-project/codespell
-    rev: v2.4.1
+    rev: v2.4.2
     hooks:
       - id: codespell
         additional_dependencies:
           - tomli
 
   - repo: https://github.com/tox-dev/pyproject-fmt
-    rev: v2.12.1
+    rev: v2.21.0
     hooks:
       - id: pyproject-fmt
 
@@ -45,19 +45,19 @@ repos:
         pass_filenames: false
 
   - repo: https://github.com/abravalheri/validate-pyproject
-    rev: v0.24.1
+    rev: v0.25
     hooks:
       - id: validate-pyproject
 
-  - repo: https://github.com/pre-commit/mirrors-mypy
-    rev: v1.19.1
-    hooks:
-      - id: mypy
-        args:
-          - --explicit-package-bases
-          - --ignore-missing-imports
-          - --install-types
-          - --non-interactive
+  # - repo: https://github.com/pre-commit/mirrors-mypy
+  #  rev: v1.20.0
+  #  hooks:
+  #    - id: mypy
+  #      args:
+  #        - --explicit-package-bases
+  #        - --ignore-missing-imports
+  #        - --install-types
+  #        - --non-interactive
 
   - repo: https://github.com/pre-commit/mirrors-prettier
     rev: v4.0.0-alpha.8
diff --git a/DIRECTORY.md b/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)
@@ -981,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)
diff --git a/backtracking/generate_parentheses.py b/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] = []
diff --git a/backtracking/n_queens.py b/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
diff --git a/backtracking/word_break.py b/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)
diff --git a/digital_image_processing/filters/local_binary_pattern.py b/digital_image_processing/filters/local_binary_pattern.py
@@ -19,7 +19,7 @@ def get_neighbors_pixel(
 
     try:
         return int(image[x_coordinate][y_coordinate] >= center)
-    except (IndexError, TypeError):
+    except IndexError, TypeError:
         return 0
 
 
diff --git a/divide_and_conquer/convex_hull.py b/divide_and_conquer/convex_hull.py
@@ -124,7 +124,7 @@ def _construct_points(
             else:
                 try:
                     points.append(Point(p[0], p[1]))
-                except (IndexError, TypeError):
+                except IndexError, TypeError:
                     print(
                         f"Ignoring deformed point {p}. All points"
                         " must have at least 2 coordinates."
diff --git a/dynamic_programming/catalan_numbers.py b/dynamic_programming/catalan_numbers.py
@@ -71,7 +71,7 @@ def catalan_numbers(upper_limit: int) -> "list[int]":
                 print(f"The Catalan numbers from 0 through {N} are:")
                 print(catalan_numbers(N))
                 print("Try another upper limit for the sequence: ", end="")
-    except (NameError, ValueError):
+    except NameError, ValueError:
         print("\n********* Invalid input, goodbye! ************\n")
 
     import doctest
diff --git a/geodesy/lamberts_ellipsoidal_distance.py b/geodesy/lamberts_ellipsoidal_distance.py
@@ -32,6 +32,26 @@ def lamberts_ellipsoidal_distance(
     Returns:
         geographical distance between two points in metres
 
+    >>> lamberts_ellipsoidal_distance(100, 0, 0, 0)
+    Traceback (most recent call last):
+    ...
+    ValueError: Latitude must be between -90 and 90 degrees
+
+    >>> lamberts_ellipsoidal_distance(0, 0, -100, 0)
+    Traceback (most recent call last):
+    ...
+    ValueError: Latitude must be between -90 and 90 degrees
+
+    >>> lamberts_ellipsoidal_distance(0, 200, 0, 0)
+    Traceback (most recent call last):
+    ...
+    ValueError: Longitude must be between -180 and 180 degrees
+
+    >>> lamberts_ellipsoidal_distance(0, 0, 0, -200)
+    Traceback (most recent call last):
+    ...
+    ValueError: Longitude must be between -180 and 180 degrees
+
     >>> from collections import namedtuple
     >>> point_2d = namedtuple("point_2d", "lat lon")
     >>> SAN_FRANCISCO = point_2d(37.774856, -122.424227)
@@ -46,6 +66,14 @@ def lamberts_ellipsoidal_distance(
     '9,737,326 meters'
     """
 
+    # Validate latitude values
+    if not -90 <= lat1 <= 90 or not -90 <= lat2 <= 90:
+        raise ValueError("Latitude must be between -90 and 90 degrees")
+
+    # Validate longitude values
+    if not -180 <= lon1 <= 180 or not -180 <= lon2 <= 180:
+        raise ValueError("Longitude must be between -180 and 180 degrees")
+
     # CONSTANTS per WGS84 https://en.wikipedia.org/wiki/World_Geodetic_System
     # Distance in metres(m)
     # Equation Parameters
diff --git a/hashes/hamming_code.py b/hashes/hamming_code.py
@@ -118,7 +118,6 @@ def emitter_converter(size_par, data):
             data_ord.append(None)
 
     # Calculates parity
-    qtd_bp = 0  # parity bit counter
     for bp in range(1, size_par + 1):
         # Bit counter one for a given parity
         cont_bo = 0
@@ -133,8 +132,6 @@ def emitter_converter(size_par, data):
                     cont_bo += 1
         parity.append(cont_bo % 2)
 
-        qtd_bp += 1
-
     # Mount the message
     cont_bp = 0  # parity bit counter
     for x in range(size_par + len(data)):
@@ -208,7 +205,6 @@ def receptor_converter(size_par, data):
             data_ord.append(None)
 
     # Calculates parity
-    qtd_bp = 0  # parity bit counter
     for bp in range(1, size_par + 1):
         # Bit counter one for a certain parity
         cont_bo = 0
@@ -222,8 +218,6 @@ def receptor_converter(size_par, data):
                     cont_bo += 1
         parity.append(str(cont_bo % 2))
 
-        qtd_bp += 1
-
     # Mount the message
     cont_bp = 0  # Parity bit counter
     for x in range(size_par + len(data_output)):
diff --git a/maths/greatest_common_divisor.py b/maths/greatest_common_divisor.py
@@ -73,7 +73,7 @@ def main():
             f"{greatest_common_divisor(num_1, num_2)}"
         )
         print(f"By iterative gcd({num_1}, {num_2}) = {gcd_by_iterative(num_1, num_2)}")
-    except (IndexError, UnboundLocalError, ValueError):
+    except IndexError, UnboundLocalError, ValueError:
         print("Wrong input")
 
 
diff --git a/project_euler/problem_002/sol4.py b/project_euler/problem_002/sol4.py
@@ -56,7 +56,7 @@ def solution(n: int = 4000000) -> int:
 
     try:
         n = int(n)
-    except (TypeError, ValueError):
+    except TypeError, ValueError:
         raise TypeError("Parameter n must be int or castable to int.")
     if n <= 0:
         raise ValueError("Parameter n must be greater than or equal to one.")
diff --git a/project_euler/problem_003/sol1.py b/project_euler/problem_003/sol1.py
@@ -80,7 +80,7 @@ def solution(n: int = 600851475143) -> int:
 
     try:
         n = int(n)
-    except (TypeError, ValueError):
+    except TypeError, ValueError:
         raise TypeError("Parameter n must be int or castable to int.")
     if n <= 0:
         raise ValueError("Parameter n must be greater than or equal to one.")
diff --git a/project_euler/problem_003/sol2.py b/project_euler/problem_003/sol2.py
@@ -44,7 +44,7 @@ def solution(n: int = 600851475143) -> int:
 
     try:
         n = int(n)
-    except (TypeError, ValueError):
+    except TypeError, ValueError:
         raise TypeError("Parameter n must be int or castable to int.")
     if n <= 0:
         raise ValueError("Parameter n must be greater than or equal to one.")
diff --git a/project_euler/problem_003/sol3.py b/project_euler/problem_003/sol3.py
@@ -44,7 +44,7 @@ def solution(n: int = 600851475143) -> int:
 
     try:
         n = int(n)
-    except (TypeError, ValueError):
+    except TypeError, ValueError:
         raise TypeError("Parameter n must be int or castable to int.")
     if n <= 0:
         raise ValueError("Parameter n must be greater than or equal to one.")
diff --git a/project_euler/problem_005/sol1.py b/project_euler/problem_005/sol1.py
@@ -47,7 +47,7 @@ def solution(n: int = 20) -> int:
 
     try:
         n = int(n)
-    except (TypeError, ValueError):
+    except TypeError, ValueError:
         raise TypeError("Parameter n must be int or castable to int.")
     if n <= 0:
         raise ValueError("Parameter n must be greater than or equal to one.")
diff --git a/project_euler/problem_007/sol2.py b/project_euler/problem_007/sol2.py
@@ -87,7 +87,7 @@ def solution(nth: int = 10001) -> int:
 
     try:
         nth = int(nth)
-    except (TypeError, ValueError):
+    except TypeError, ValueError:
         raise TypeError("Parameter nth must be int or castable to int.") from None
     if nth <= 0:
         raise ValueError("Parameter nth must be greater than or equal to one.")
diff --git a/project_euler/problem_015/sol2.py b/project_euler/problem_015/sol2.py
@@ -0,0 +1,32 @@
+"""
+Problem 15: https://projecteuler.net/problem=15
+
+Starting in the top left corner of a 2x2 grid, and only being able to move to
+the right and down, there are exactly 6 routes to the bottom right corner.
+How many such routes are there through a 20x20 grid?
+"""
+
+
+def solution(n: int = 20) -> int:
+    """
+    Solve by explicitly counting the paths with dynamic programming.
+
+    >>> solution(6)
+    924
+    >>> solution(2)
+    6
+    >>> solution(1)
+    2
+    """
+
+    counts = [[1 for _ in range(n + 1)] for _ in range(n + 1)]
+
+    for i in range(1, n + 1):
+        for j in range(1, n + 1):
+            counts[i][j] = counts[i - 1][j] + counts[i][j - 1]
+
+    return counts[n][n]
+
+
+if __name__ == "__main__":
+    print(solution())
diff --git a/pyproject.toml b/pyproject.toml
diff --git a/sorts/pigeonhole_sort.py b/sorts/pigeonhole_sort.py
diff --git a/sorts/unknown_sort.py b/sorts/unknown_sort.py
diff --git a/web_programming/fetch_well_rx_price.py b/web_programming/fetch_well_rx_price.py
diff --git a/web_programming/instagram_crawler.py b/web_programming/instagram_crawler.py
