aoc21 VS advent-of-code

I only had time to look at today problem 10 minutes ago. Part 1 in Rust is here. I got a O(m*n) time complexity here (m is the number bitstring length, n is the number of bitstrings). I'm pretty sure there is a better way. Any insights?

Rust version with a single function. I wonder if at this line I can parse the integer value directly. I didn't find a way to do it yet.

Learning Rust, so there is my solution: https://github.com/finalfire/aoc21/blob/main/src/day1.rs

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