mjpieters / adventofcode Goto Github PK

Hey there!
Not really an issue, just wanted to thank you for explaining day 6 so well in your solution.
I was quite stuck and really helped me solve it. Thanks again and happy holidays!

This algorithm made assumption that half the target is not in the set. Example, with input coins:

1010
786
1234

It's needed to find the 786*1234 solution and not 1010*1010. Probably better to use a multiset (collections.Counter).

Nice notebooks this year, Martijn! I noticed the assert in Day 19.ipynb part 2 is bogus:

assert reduce(mul, largest_number_geodes(example))

It should be

assert reduce(mul, largest_number_geodes(example)) == 3472

Or even better

assert math.prod(largest_number_geodes(example)) == 3472