scrapyard VS advent-of-code

Inspired by a blog post of Nicky Meuleman and his solution for this puzzle: https://github.com/NickyMeuleman/scrapyard/blob/main/advent_of_code/2022/src/day_08.rs I refactored my code and it turned out to be ~7-10 times slower than the initial one (700μs vs. 8ms). But hey, the code looks better now and it's more concise.

If you prefer to go straight to the repo: https://github.com/NickyMeuleman/scrapyard/tree/main/advent_of_code/2022/src

rust Per step, this makes a list of all cucumbers that can move first, then mutates those in the overall map.

Solution in Rust

Rust solution, commented both solutions to clearly explain the used logic.

Rust

Rust. The windows() method is really the MVP of the day

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