advent-of-code VS Advent_of_Code_in_Pascal

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

I'm doing it in Lazarus/Free Pascal again.

https://github.com/mikewarot/Advent_of_Code_in_Pascal

Free Pascal - 2251/1744 34.5 seconds runtime No objects, no recursion After brute forcing part 1, I stared at part 2 until I though only handling the different values of X,Y,Z and letting the grid represent variable size cubes.. only to hit memory size limits anyway... and then I learned how to use BITPACKED array, and was able to eventually brute force part 2. Whew!

Pascal 2235/4609

Pascal - Github

Pascal 7079/6330 - github

Github - https://github.com/mikewarot/Advent_of_Code_in_Pascal/blob/master/2021/advent2021_15b.lpr

My pascal based solver eventually got valid text out of your input.

Pascal 2437/6187

Pascal 3590/5744