d3 part 2

Author: jameslawlor

src/advent_of_code/year_2024/day_04.py

@@ -1,5 +1,4 @@
 import numpy as np
-
 from advent_of_code.utils.input_handling import read_input
 
 STRING_TO_FIND = "XMAS"

src/advent_of_code/year_2025/day_02.py

@@ -1,6 +1,7 @@
 from advent_of_code.utils.input_handling import read_input
 
-VALID_PARTS = (1,2)
+VALID_PARTS = (1, 2)
+
 
 def parse_input(raw):
     raw_split = raw[0].split(",")
@@ -25,17 +26,23 @@ def check_id_valid(id):
     else:
         return True
 
+
 def check_id_valid_v2(id):
     id_len = len(str(id))
     half_len = id_len // 2
-    for sub_str_len in range(1,half_len+1):
+    for sub_str_len in range(1, half_len + 1):
         sub_str = id[:sub_str_len]
         str_to_search = id[sub_str_len:]
-        if (len(str_to_search) % sub_str_len == 0): # substr divisible by search str length
-            if (sub_str * (id_len // sub_str_len) == id): # substr matches N * search string 
+        if (
+            len(str_to_search) % sub_str_len == 0
+        ):  # substr divisible by search str length
+            if (
+                sub_str * (id_len // sub_str_len) == id
+            ):  # substr matches N * search string
                 return False
     return True
 
+
 def get_invalid_ids_in_range(range_pair, part):
     full_range = range(range_pair[0], range_pair[1] + 1)
 
@@ -45,7 +52,7 @@ def get_invalid_ids_in_range(range_pair, part):
         id_checker_function = check_id_valid_v2
     else:
         raise ValueError("Specify a valid part number")
-    
+
     invalid_ids = []
     for x in full_range:
         if not id_checker_function(str(x)):
@@ -74,10 +81,12 @@ def solve_part(parsed_input, part):
     invalid_ids = find_all_invalid_ids(parsed_input, part)
     return sum_invalid_ids(invalid_ids)
 
+
 def solve_part_2(parsed_input):
     invalid_ids = find_all_invalid_ids(parsed_input)
     return sum_invalid_ids(invalid_ids)
 
+
 def solve(parsed_input):
     part_1_solution = solve_part(parsed_input, part=1)
     part_2_solution = solve_part(parsed_input, part=2)

src/advent_of_code/year_2025/day_03.py

@@ -1,5 +1,6 @@
 from advent_of_code.utils.input_handling import read_input
 
+
 def parse_battery_bank_to_ints_list(battery_bank_str):
     return [int(x) for x in battery_bank_str]
 
@@ -8,18 +9,34 @@ def combine_joltages(list_of_joltages):
     return int("".join([str(x) for x in list_of_joltages]))
 
 
+def find_max_and_leftmost_index(input_list):
+    max_value = max(input_list)
+    leftmost_index = input_list.index(max_value)
+    return max_value, leftmost_index
+
+
 def calculate_largest_joltage(battery_bank_as_ints, n_batteries):
-    largest_joltage_1 = 0
-    
-    for battery_index, battery_value in enumerate(battery_bank_as_ints):
-     if (battery_value > largest_joltage_1) and (battery_index < len(battery_bank_as_ints) - 1):
-         largest_joltage_1 = battery_value
-         largest_joltage_2 = 0
-         for second_battery_value in battery_bank_as_ints[battery_index+1:]:
-             if second_battery_value > largest_joltage_2:
-                 largest_joltage_2 = second_battery_value
-    
-    return combine_joltages([largest_joltage_1, largest_joltage_2])
+
+    batteries_remaining = n_batteries
+    bank_len = len(battery_bank_as_ints)
+    list_of_joltages = []
+    start_ix = 0
+
+    while batteries_remaining > 0:
+        end_ix = bank_len - batteries_remaining + 1
+        window_to_check = battery_bank_as_ints[start_ix:end_ix]
+
+        # find largest value in window and the left-most index for dupes
+        max_value, leftmost_index_window = find_max_and_leftmost_index(window_to_check)
+        leftmost_index = leftmost_index_window + start_ix
+        list_of_joltages.append(max_value)
+
+        # reassign start_ix and update remaining batteries
+        start_ix = leftmost_index + 1
+        batteries_remaining -= 1
+
+    print(f"list_of_joltages={list_of_joltages}")
+    return combine_joltages(list_of_joltages)
 
 
 def solve_part(input, n_batteries):
@@ -32,6 +49,7 @@ def solve_part(input, n_batteries):
 
     return sum(joltage_list)
 
+
 def solve(input):
     part_1_solution = solve_part(input, n_batteries=2)
     part_2_solution = solve_part(input, n_batteries=12)

tests/year_2023/test_day_01.py

@@ -1,5 +1,4 @@
 import pytest
-
 from advent_of_code.year_2023.day_01 import (
     convert_first_last_patterns_to_calibration_value,
     convert_str_to_numerical,

tests/year_2023/test_day_02.py

@@ -1,5 +1,4 @@
 import pytest
-
 from advent_of_code.year_2023.day_02 import (
     check_game_is_possible,
     find_max_shown_for_colour,

tests/year_2023/test_day_03.py

@@ -1,5 +1,4 @@
 import pytest
-
 from advent_of_code.year_2023.day_03 import (
     Part,
     Symbol,

tests/year_2023/test_day_04.py

@@ -1,5 +1,4 @@
 import pytest
-
 from advent_of_code.year_2023.day_04 import (
     compute_copies,
     compute_total_score,

tests/year_2023/test_day_06.py

@@ -1,7 +1,6 @@
 import math
 
 import pytest
-
 from advent_of_code.year_2023.day_06 import (
     Race,
     Races,

tests/year_2024/test_day_01.py

@@ -1,5 +1,4 @@
 import pytest
-
 from advent_of_code.year_2024.day_01 import (
     solve,
 )

tests/year_2024/test_day_02.py

@@ -1,5 +1,4 @@
 import pytest
-
 from advent_of_code.year_2024.day_02 import (
     parse_input,
     solve,