Merge 20070c23e5 into f3f32ae3ca

updates:
- [github.com/astral-sh/ruff-pre-commit: v0.7.3 → v0.7.4](https://github.com/astral-sh/ruff-pre-commit/compare/v0.7.3...v0.7.4)

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

.pre-commit-config.yaml

@@ -16,7 +16,7 @@ repos:
       - id: auto-walrus
 
   - repo: https://github.com/astral-sh/ruff-pre-commit
-    rev: v0.7.2
+    rev: v0.7.4
     hooks:
       - id: ruff
       - id: ruff-format
@@ -42,7 +42,7 @@ repos:
         pass_filenames: false
 
   - repo: https://github.com/abravalheri/validate-pyproject
-    rev: v0.22
+    rev: v0.23
     hooks:
       - id: validate-pyproject
 

bit_manipulation/single_number.py

@@ -0,0 +1,30 @@
+def single_number(nums: list[int]) -> int:
+    """
+    Find the single number in an array where every other number appears twice.
+
+    Args:
+        nums: List of integers where every integer appears twice except for one.
+
+    Returns:
+        The single integer that appears once.
+
+    Example:
+    >>> single_number([4, 1, 2, 1, 2])
+    4
+    >>> single_number([2, 2, 1])
+    1
+    >>> single_number([1])
+    1
+    """
+    result = 0
+    for num in nums:
+        result ^= num  # Applying XOR operation
+    return result
+
+
+if __name__ == "__main__":
+    # Test cases
+    print(single_number([4, 1, 2, 1, 2]))  # Output: 4
+    print(single_number([2, 2, 1]))  # Output: 1
+    print(single_number([1]))  # Output: 1
+    print(single_number([5, 3, 5, 7, 3]))  # Output: 7

data_structures/arrays/sudoku_solver.py

@@ -172,7 +172,7 @@ def solved(values):
 
 def from_file(filename, sep="\n"):
     "Parse a file into a list of strings, separated by sep."
-    return open(filename).read().strip().split(sep)  # noqa: SIM115
+    return open(filename).read().strip().split(sep)
 
 
 def random_puzzle(assignments=17):

scripts/validate_filenames.py

@@ -1,4 +1,4 @@
-#!/usr/bin/env python3
+#!python
 import os
 
 try: