started out thinking to solve this using a quadratic formula like @CoG - but it turns out that the brue-force method runs in just a few seconds anyway, so rather spend extra time finishing Day 5...
I will go back and take a look at how others have solve this thought - just for learning.
Spoiler
the basic process:
- Parse the data into a table like this
- then use Generate Rows to generate valid combinations of hold times - here I could use math to limit the population
- Then just filter the valid ones
The only difference between part 1 and part 2 - is that in part 2 I also cleaned out the whitespace so there is only one race in this set.
- Parse the data into a table like this
- then use Generate Rows to generate valid combinations of hold times - here I could use math to limit the population
- Then just filter the valid ones
The only difference between part 1 and part 2 - is that in part 2 I also cleaned out the whitespace so there is only one race in this set.
