aoc2021 VS advent-of-code

Full code is here: Github

Go / Golang with contains and sorting to match. Could use some cleanup and a good set logic... But run out of time. :D

Go / Golang Tutorial Blog Post.

Solution: https://github.com/Skarlso/aoc2021/tree/main/day02 Blog post: https://skarlso.github.io/2021/12/02/aoc-day2/

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