* Add solutions for day 2-7, 2025

* pre-commit config update

Author: mkopec87

.pre-commit-config.yaml

@@ -1,113 +1,113 @@
 repos:
-  - repo: https://gitlab.com/vojko.pribudic.foss/pre-commit-update
+-   repo: https://gitlab.com/vojko.pribudic.foss/pre-commit-update
     rev: v0.9.0
     hooks:
       # Update pre-commit scripts
-      - id: pre-commit-update
+    -   id: pre-commit-update
 
-  - repo: https://github.com/astral-sh/uv-pre-commit
-    rev: 0.9.13
+-   repo: https://github.com/astral-sh/uv-pre-commit
+    rev: 0.9.16
     hooks:
       # Update the uv lockfile
-      - id: uv-lock
+    -   id: uv-lock
 
-  - repo: https://github.com/asottile/pyupgrade
+-   repo: https://github.com/asottile/pyupgrade
     rev: v3.21.2
     hooks:
       # Upgrade syntax for newer versions of the language
-      - id: pyupgrade
+    -   id: pyupgrade
         args: [--py312-plus]
 
-  - repo: https://github.com/pre-commit/pre-commit-hooks
+-   repo: https://github.com/pre-commit/pre-commit-hooks
     rev: v6.0.0
     hooks:
       # Prevent giant files from being committed
-      - id: check-added-large-files
+    -   id: check-added-large-files
       # Check whether files parse as valid python
-      - id: check-ast
+    -   id: check-ast
       # Require literal syntax for empty or zero Python builtin types
-      - id: check-builtin-literals
+    -   id: check-builtin-literals
       # Check for files with conflict on a case-insensitive filesystem
-      - id: check-case-conflict
+    -   id: check-case-conflict
       # Checks that non-binary executables have a proper shebang
-      - id: check-executables-have-shebangs
+    -   id: check-executables-have-shebangs
       # Check for files that cannot be created on Windows
-      - id: check-illegal-windows-names
+    -   id: check-illegal-windows-names
       # Attempts to load all json files to verify syntax
-      - id: check-json
+    -   id: check-json
       # Checks that scripts with shebangs are executable
-      - id: check-shebang-scripts-are-executable
+    -   id: check-shebang-scripts-are-executable
       # Checks for symlinks which do not point to anything
-      - id: check-symlinks
+    -   id: check-symlinks
       # Attempts to load all TOML files to verify syntax
-      - id: check-toml
+    -   id: check-toml
       # Attempts to load all yaml files to verify syntax
-      - id: check-yaml
+    -   id: check-yaml
       # Makes sure files end in a newline and only a newline
-      - id: end-of-file-fixer
+    -   id: end-of-file-fixer
       # Removes UTF-8 byte order marker
-      - id: fix-byte-order-marker
+    -   id: fix-byte-order-marker
       # Replaces or checks mixed line ending
-      - id: mixed-line-ending
+    -   id: mixed-line-ending
       # Verifies that test files are named correctly
-      - id: name-tests-test
+    -   id: name-tests-test
         args: [--pytest-test-first]
       # Protect specific branches from direct checkins
-      - id: no-commit-to-branch
+    -   id: no-commit-to-branch
         args: [-b, dev]
       # Trims trailing whitespace
-      - id: trailing-whitespace
+    -   id: trailing-whitespace
 
-  - repo: https://github.com/adrienverge/yamllint.git
+-   repo: https://github.com/adrienverge/yamllint.git
     rev: v1.37.1
     hooks:
       # Lint YAML files
-      - id: yamllint
+    -   id: yamllint
 
-  - repo: https://github.com/astral-sh/ruff-pre-commit
-    rev: v0.14.7
+-   repo: https://github.com/astral-sh/ruff-pre-commit
+    rev: v0.14.8
     hooks:
       # Run the linter
-      - id: ruff-check
+    -   id: ruff-check
         args: [--fix, --show-fixes, --exit-non-zero-on-fix]
       # Run the formatter
-      - id: ruff-format
+    -   id: ruff-format
 
   # local hook used to avoid repeating dependencies list
-  - repo: local
+-   repo: local
     hooks:
       # Check type annotations
-      - id: mypy
+    -   id: mypy
         name: mypy
         entry: mypy
         require_serial: true
         language: system
         'types_or': [python, pyi]
 
-  - repo: https://github.com/fpgmaas/deptry.git
+-   repo: https://github.com/fpgmaas/deptry.git
     rev: 0.24.0
     hooks:
       # Check for problems in dependency declarations
-      - id: deptry
+    -   id: deptry
         args: ["src"]
 
-  - repo: https://github.com/codespell-project/codespell
+-   repo: https://github.com/codespell-project/codespell
     rev: v2.4.1
     hooks:
       # Fix common misspellings in text files
-      - id: codespell
+    -   id: codespell
         additional_dependencies:
-          - tomli
+        -   tomli
 
-  - repo: https://github.com/jendrikseipp/vulture
+-   repo: https://github.com/jendrikseipp/vulture
     rev: v2.14
     hooks:
       # Finds unused code
-      - id: vulture
+    -   id: vulture
 
-  - repo: https://github.com/pappasam/toml-sort
+-   repo: https://github.com/pappasam/toml-sort
     rev: v0.24.3
     hooks:
       # Sort and format toml files
-      - id: toml-sort
+    -   id: toml-sort
         args: ["pyproject.toml"]

src/2025/01/2025_01.py

@@ -44,7 +44,6 @@ def parse_input(input_data: str) -> list[Rotation]:
 def solve(
     init_pos: int, limit: int, commands: list[Rotation], part2: bool = False
 ) -> int:
-    print()
     result = 0
 
     current_pos = init_pos
@@ -76,5 +75,5 @@ def solve(
 
 if __name__ == "__main__":
     debug_mode = True
-    debug_mode = False
+    # debug_mode = False
     main(debug_mode)

src/2025/02/2025_02.py

@@ -0,0 +1,73 @@
+import math
+
+from src.utils.data import load_data
+from src.utils.submission import submit_or_print
+
+
+def main(debug: bool) -> None:
+    input_data = load_data(debug)
+
+    ranges = parse_input(input_data)
+
+    result_part1 = solve_part1(ranges)
+    result_part2 = solve_part2(ranges)
+
+    submit_or_print(result_part1, result_part2, debug)
+
+
+def parse_input(input_data: str) -> set[tuple[int, int]]:
+    splits = input_data.split(",")
+    ranges = set()
+    for s in splits:
+        s = s.split("-")
+        ranges.add((int(s[0]), int(s[1])))
+    return ranges
+
+
+def solve_part1(ranges: set[tuple[int, int]]) -> int:
+    result = 0
+    for start, end in ranges:
+        for i in range(start, end + 1):
+            i_str = str(i)
+            if len(i_str) % 2 != 0:
+                continue
+            half_len = len(i_str) // 2
+            if i_str[half_len:] == i_str[:half_len]:
+                result += i
+    return result
+
+
+def solve_part2(ranges: set[tuple[int, int]]) -> int:
+    result = 0
+    for start, end in sorted(ranges):
+        for i in range(start, end + 1):
+            i_str = str(i)
+            valid = False
+            for divisor in get_divisors(len(i_str)):
+                chunks = set()
+                for j in range(0, len(i_str), divisor):
+                    chunk = i_str[j : j + divisor]
+                    chunks.add(chunk)
+                    if len(chunks) > 1:
+                        break
+                if len(chunks) == 1:
+                    valid = True
+                    break
+            if valid:
+                result += i
+    return result
+
+
+def get_divisors(n: int) -> set[int]:
+    divisors = set()
+    for i in range(1, int(math.sqrt(n)) + 2):
+        if n % i == 0:
+            divisors.add(i)
+            divisors.add(n // i)
+    return divisors - {n}
+
+
+if __name__ == "__main__":
+    debug_mode = True
+    # debug_mode = False
+    main(debug_mode)

src/2025/02/sample_input.txt

@@ -0,0 +1 @@
+11-33,195-1115,9398-12012

src/2025/03/2025_03.py

@@ -0,0 +1,49 @@
+from src.utils.data import load_data
+from src.utils.submission import submit_or_print
+
+
+def main(debug: bool) -> None:
+    input_data = load_data(debug)
+    banks = parse_data(input_data)
+
+    result_part1 = solve(banks)
+    result_part2 = solve(banks, digits=12)
+
+    submit_or_print(result_part1, result_part2, debug)
+
+
+def parse_data(input_data: str):
+    return [list(map(int, bank)) for bank in input_data.splitlines()]
+
+
+def solve(banks: list[list[int]], digits: int = 2) -> int:
+    result = 0
+    for bank in banks:
+        batteries = []
+        start = 0
+        end = len(bank) - digits
+        for _ in range(digits):
+            max_digit, max_digit_position = find_max_digit(bank, start, end)
+            start = max_digit_position + 1
+            end = end + 1
+            batteries.append(max_digit)
+        result += int("".join(map(str, batteries)))
+
+    return result
+
+
+def find_max_digit(bank: list[int], start: int, end: int) -> tuple[int, int]:
+    max_digit = -1
+    max_digit_position = None
+    for i in range(end, start - 1, -1):
+        digit = bank[i]
+        if digit >= max_digit:
+            max_digit = digit
+            max_digit_position = i
+    return max_digit, max_digit_position
+
+
+if __name__ == "__main__":
+    debug_mode = True
+    # debug_mode = False
+    main(debug_mode)

src/2025/03/sample_input.txt

@@ -0,0 +1,3 @@
+511111111111114
+987654321111111
+124342342345672

src/2025/04/2025_04.py

@@ -0,0 +1,75 @@
+from itertools import repeat, product
+
+import numpy as np
+
+from src.utils.data import load_data
+from src.utils.submission import submit_or_print
+
+
+def main(debug: bool) -> None:
+    input_data = load_data(debug)
+
+    grid = parse_input(input_data)
+
+    result_part1 = solve_part1(grid)
+    result_part2 = solve_part2(grid)
+
+    submit_or_print(result_part1, result_part2, debug)
+
+
+def parse_input(input_data: str) -> np.ndarray:
+    rows = [list(line) for line in input_data.splitlines()]
+    # add guards
+    for row in rows:
+        row.insert(0, ".")
+        row.append(".")
+    rows.insert(0, list(repeat(".", len(rows[0]))))
+    rows.append(list(repeat(".", len(rows[0]))))
+
+    return np.array(rows)
+
+
+def solve_part1(grid: np.ndarray) -> int:
+    result = 0
+    it = np.nditer(grid, flags=["multi_index"])
+    for elem in it:
+        if elem == "@":
+            x, y = it.multi_index
+            neighboring_rolls = 0
+            for xd, yd in product([-1, 0, 1], [-1, 0, 1]):
+                if xd == yd == 0:
+                    continue
+                if grid[x + xd, y + yd] == "@":
+                    neighboring_rolls += 1
+            if neighboring_rolls < 4:
+                result += 1
+    return result
+
+
+def solve_part2(grid: np.ndarray) -> int:
+    result = 0
+    while True:
+        removed = False
+        it = np.nditer(grid, flags=["multi_index"])
+        for elem in it:
+            if elem == "@":
+                x, y = it.multi_index
+                neighboring_rolls = 0
+                for xd, yd in product([-1, 0, 1], [-1, 0, 1]):
+                    if xd == yd == 0:
+                        continue
+                    if grid[x + xd, y + yd] == "@":
+                        neighboring_rolls += 1
+                if neighboring_rolls < 4:
+                    grid[x, y] = "."
+                    result += 1
+                    removed = True
+        if not removed:
+            break
+    return result
+
+
+if __name__ == "__main__":
+    debug_mode = True
+    # debug_mode = False
+    main(debug_mode)

src/2025/04/sample_input.txt

@@ -0,0 +1,3 @@
+.@@.@.@.@@
+@.@@@.@...
+@@.@.@.@@.