advent-of-code VS adventofcode

JavaScript

Almost walked away from this when caught out by the "empty" space flipping. But stuck with it and managed to make it work without changing my approach too much.

I enjoyed this one, despite all the reading. Felt like a nice change of gear from yesterday's. Using recursion to read sub-packets from the binary string, using a function that returns the value (or version sum in part 1) as well as the length, so I know where to read from for the next sub-packet.

Enjoyed today's one, short and sweet

Mine is similar (but in JS)

Struggled to get my head around the explanation of part 2 today, need more coffee

not the most inspired solution

JS solutions, already settled back into the habit of relying on reduce functions

GitHub - Solutions to both halves

You can see an unedited log of me finding my day 3 solution. Then try imagine doing the same but compiling each time. It would be quite different, not so organic, and unless some effort was done you would not be able to see my thought process.

Done as a C# interactive notebook, rest of my solutions in here.