AoC day1

from blog blog, | ↗ original
AoC day 1 The puzzles of day one were easy to solve in the first place, but have more potential to optimize than I thought. Problem Find n addends which add up to 2020. Solution of the puzzle is the product of all addends where n=2 in puzzle one and n=3 in puzzle two. Solution The idea was to find all unique subsets with n elements, where n=2 in...