* Formatting updates

Author: mkopec87

.pre-commit-config.yaml

@@ -6,7 +6,7 @@ repos:
     -   id: pre-commit-update
 
 -   repo: https://github.com/astral-sh/uv-pre-commit
-    rev: 0.9.16
+    rev: 0.9.17
     hooks:
       # Update the uv lockfile
     -   id: uv-lock
@@ -45,6 +45,7 @@ repos:
     -   id: check-yaml
       # Makes sure files end in a newline and only a newline
     -   id: end-of-file-fixer
+        exclude: src/.*/sample_input.txt
       # Removes UTF-8 byte order marker
     -   id: fix-byte-order-marker
       # Replaces or checks mixed line ending
@@ -65,7 +66,7 @@ repos:
     -   id: yamllint
 
 -   repo: https://github.com/astral-sh/ruff-pre-commit
-    rev: v0.14.8
+    rev: v0.14.9
     hooks:
       # Run the linter
     -   id: ruff-check

pyproject.toml

@@ -6,6 +6,7 @@ dev = [
   "pre-commit",
   "pytest",
   "pytest-cov",
+  "scipy-stubs",
 ]
 
 [project]
@@ -16,6 +17,7 @@ dependencies = [
   "numpy",
   "scipy",
   "tqdm",
+  "z3-solver>=4.15.4.0",
 ]
 description = "My solutions to Advent of Code programming puzzles."
 name = "advent-of-code"

src/2017/01/2017_01.py

@@ -1,5 +1,3 @@
-from typing import List
-
 from src.utils.data import load_data
 from src.utils.submission import submit_or_print
 
@@ -14,7 +12,7 @@ def main(debug: bool) -> None:
     submit_or_print(result_part1, result_part2, debug)
 
 
-def solve(digits: List[int], shift: int) -> int:
+def solve(digits: list[int], shift: int) -> int:
     return sum(
         [d for i, d in enumerate(digits) if digits[(i + shift) % len(digits)] == d]
     )

src/2019/02/2019_02.py

@@ -1,6 +1,5 @@
 from itertools import product
 from operator import add, mul
-from typing import List
 
 from src.utils.data import load_data
 from src.utils.submission import submit_or_print
@@ -25,7 +24,7 @@ def main(debug: bool) -> None:
     submit_or_print(result_part1, result_part2, debug)
 
 
-def solve(input_list: List[int], val1: int, val2: int) -> List[int]:
+def solve(input_list: list[int], val1: int, val2: int) -> list[int]:
     try:
         memory = input_list.copy()
         memory[1] = val1

src/2020/01/2020_01.py

@@ -1,12 +1,11 @@
 from itertools import combinations
 from math import prod
-from typing import Set
 
 from src.utils.data import load_data
 from src.utils.submission import submit_or_print
 
 
-def solve(numbers: Set[int], numbers_count: int, target_sum: int) -> int:
+def solve(numbers: set[int], numbers_count: int, target_sum: int) -> int:
     sets = combinations(numbers, numbers_count)
     matching_sets = list(filter(lambda s: sum(s) == target_sum, sets))
     assert len(matching_sets) == 1

src/2020/02/2020_02.py

@@ -1,12 +1,12 @@
 import re
 from collections import Counter
-from typing import Any, List, Tuple
+from typing import Any
 
 from src.utils.data import load_data
 from src.utils.submission import submit_or_print
 
 
-def parse_input(input_data: str) -> List[Tuple[Any, ...]]:
+def parse_input(input_data: str) -> list[tuple[Any, ...]]:
     result = []
     for line in input_data.splitlines():
         m = re.match(r"(\d+)-(\d+) ([a-z]): ([a-z]+)", line)
@@ -23,14 +23,14 @@ def main(debug: bool) -> None:
 
     lines = parse_input(input_data)
 
-    def correct_part1(line: Tuple[Any, ...]):
+    def correct_part1(line: tuple[Any, ...]):
         first_number, second_number, character, password = line
         c = Counter(password)
         return first_number <= c[character] <= second_number
 
     result_part1 = len(list(filter(correct_part1, lines)))
 
-    def correct_part2(line: Tuple[Any, ...]):
+    def correct_part2(line: tuple[Any, ...]):
         first_number, second_number, character, password = line
         password = " " + password  # make indexing 1-based
         return (password[first_number] == character) ^ (