advent-of-code VS AdventOfCode2021

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

My Kotlin solution for Day 3. I'm not particularly proud of this solution as I feel that I may have missed something working with binary numbers and may have brute forced a bit in some parts. But at least I had the opportunity to use Kotlin script for the first time ever (inspired by some other user that posted a solution on Day 2 using it) and some cool lambdas to encapsulate bit criteria logic, all while staying immutable and using recursion instead of loops. :D

Day 2, Kotlin still going strong. Today I had the opportunity to explore functional collections operations (fold and reduce) :D

First time participating on AoC :D, it's been a fun first day! So here is my solution in Kotlin.