Bogdanp / aoc2020

make day 9 part 2 more efficient
The trick here is to constantly be testing the longest run possible and constrain the high and low indexes accordingly. When you find a run whose sum is the target, that's guaranteed to be the longest run.
Bogdan Popa Bogdan Popa committed on Dec 9, 2020, 10:19 AM
Showing 1 changed files +15 additions -24 deletions
M day09.rkt +15 -24
Browse files at this commit โ†’