advent-of-code VS aoc2021

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.

Go, 19196/19041

Go, 1093/563

Go, 2758/2421

Go, 631/732

Go 1449/3191

Go, 2400/1659

Go, 3030/3121

Oh also lost about 2-3 minutes on part A initially trying to use my challenge.TileMap so I didn't have to worry about computing x/y but converting to/from rune all the time was taking way too long and was hard to follow. Man, I can't wait until generics!

Go, 2815/3818

Go, 1730/3574