You've already forked advent_of_code
feat: Actually day 4 of '25
This commit is contained in:
@@ -26,9 +26,8 @@ def get_highest_dynamic(bank_size: int, input: str) -> int:
|
||||
for i in range(bank_size, 0, -1):
|
||||
curr_highest = 0
|
||||
highest_index = 0
|
||||
limit = len(input) - i + 1
|
||||
|
||||
for j in range(curr_index, limit):
|
||||
for j in range(curr_index, len(input) - i + 1):
|
||||
found = int(input[j])
|
||||
|
||||
if found > curr_highest:
|
||||
|
||||
Reference in New Issue
Block a user