advent-of-code VS Advent-of-Code

For a full write-up, see this repo, and for a non-annotated solution, see:

Otherwise, the main way I solved this was with a flat list of tokens rather than a truly nested structure. This was very similar to last year's Day 18, which I also solved in a similar manner.

Code can be found in this repo.

code

First 2D one! Got to reuse my InfiniteGrid class, which made this much easier.

Mine only took about 2 minutes when I originally recorded it. I've since added some optimizations to my Intcode computer, and re-running my original program with the optimized computer now runs in about 45 seconds. 😁

Here is my solution in JS, which also has a long comment explaining the main iterative loop.

Your solution is very similar to mine, and I too found that using an Array of a set size was way faster than an ordinary Object. I believe it has to resizing the array / object.

Main code for part two here, with comments, and full code for all parts found here.

Fun one :D

Way trickier than I was expecting

:D

Classic LCM

Who wants spaghetti?

Much easier than yesterday's :D

195/242

Messy. Thankfully got part two pretty quickly recognizing that we can mod the worry level by the product of the test integers. Might refactor / clean this up tomorrow morning

2343 / 2119

Impressive how fast everyone was with this one today