[pre-commit.ci] pre-commit autoupdate (TheAlgorithms#12234)

* [pre-commit.ci] pre-commit autoupdate

updates:
- [github.com/astral-sh/ruff-pre-commit: v0.6.9 → v0.7.0](astral-sh/ruff-pre-commit@v0.6.9...v0.7.0)
- [github.com/tox-dev/pyproject-fmt: 2.3.0 → 2.4.3](tox-dev/pyproject-fmt@2.3.0...2.4.3)
- [github.com/abravalheri/validate-pyproject: v0.20.2 → v0.21](abravalheri/validate-pyproject@v0.20.2...v0.21)
- [github.com/pre-commit/mirrors-mypy: v1.11.2 → v1.12.1](pre-commit/mirrors-mypy@v1.11.2...v1.12.1)

* project_euler/problem_047/sol1.py: def solution(n: int = 4) -> int | None:

* Update sol1.py

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Co-authored-by: Christian Clauss <[email protected]>

Author: pre-commit-ci[bot]

.pre-commit-config.yaml

@@ -16,7 +16,7 @@ repos:
       - id: auto-walrus
 
   - repo: https://github.com/astral-sh/ruff-pre-commit
-    rev: v0.6.9
+    rev: v0.7.0
     hooks:
       - id: ruff
       - id: ruff-format
@@ -29,7 +29,7 @@ repos:
           - tomli
 
   - repo: https://github.com/tox-dev/pyproject-fmt
-    rev: "2.3.0"
+    rev: "2.4.3"
     hooks:
       - id: pyproject-fmt
 
@@ -42,12 +42,12 @@ repos:
         pass_filenames: false
 
   - repo: https://github.com/abravalheri/validate-pyproject
-    rev: v0.20.2
+    rev: v0.21
     hooks:
       - id: validate-pyproject
 
   - repo: https://github.com/pre-commit/mirrors-mypy
-    rev: v1.11.2
+    rev: v1.12.1
     hooks:
       - id: mypy
         args:

project_euler/problem_047/sol1.py

@@ -24,7 +24,7 @@
 def unique_prime_factors(n: int) -> set:
     """
     Find unique prime factors of an integer.
-    Tests include sorting because only the set really matters,
+    Tests include sorting because only the set matters,
     not the order in which it is produced.
     >>> sorted(set(unique_prime_factors(14)))
     [2, 7]
@@ -58,7 +58,7 @@ def upf_len(num: int) -> int:
 
 def equality(iterable: list) -> bool:
     """
-    Check equality of ALL elements in an iterable
+    Check the equality of ALL elements in an iterable
     >>> equality([1, 2, 3, 4])
     False
     >>> equality([2, 2, 2, 2])
@@ -69,23 +69,23 @@ def equality(iterable: list) -> bool:
     return len(set(iterable)) in (0, 1)
 
 
-def run(n: int) -> list:
+def run(n: int) -> list[int]:
     """
     Runs core process to find problem solution.
     >>> run(3)
     [644, 645, 646]
     """
 
     # Incrementor variable for our group list comprehension.
-    # This serves as the first number in each list of values
+    # This is the first number in each list of values
     # to test.
     base = 2
 
     while True:
         # Increment each value of a generated range
         group = [base + i for i in range(n)]
 
-        # Run elements through out unique_prime_factors function
+        # Run elements through the unique_prime_factors function
         # Append our target number to the end.
         checker = [upf_len(x) for x in group]
         checker.append(n)
@@ -98,7 +98,7 @@ def run(n: int) -> list:
         base += 1
 
 
-def solution(n: int = 4) -> int:
+def solution(n: int = 4) -> int | None:
     """Return the first value of the first four consecutive integers to have four
     distinct prime factors each.
     >>> solution()