Advent of Code 2018, day 3
I’ve got today’s solutions up. This problem wasn’t really amenable to
using hashes, so I just brute-forced it with a 1,000×1,000-element
array (hey, memory is cheap!). FIND-VALID-CLAIMS is O(n²) (due to a
O(n) list deletion performed O(n) times), but … CPU is cheap too, and
these are puzzles, not production code. That’s a running theme
throughout these solutions: I’m not playing for high-performance or
highly-elegant solutions to the puzzles, just the correct answers,
quickly.