advent-of-code VS aoc

This was a pretty fun day! I'm very glad that I took the time to write a small utility module for handling multidimensional arrays in Erlang a few days ago: otherwise, trying to wrestle coördinates would have quickly become painful. This was also my first time writing DFS in Erlang; a queue-based tail-recursive approach ended up being much cleaner than a simple recursive approach that used lists:foldl/3 to pass the modified matrix between neighbours. Writing the algorithm both was was definitely a great learning experience though!

Solution on GitHub

Personally I just stick to raw arrays for most days, usually with static storage (so pre-allocated). Keeps things simple! Here's my repo.

- C -

Here's my solution. Sorry, I did go a bit overboard making it compact.

That was one heck of a tough day but also very satisfying. I spent quite some time working out a 3D rectangle splitting/merging algorithm on paper and then I had to go and implement that in C. It turned out pretty clean and idiomatic, if I may say so!

This was my first attempt (or at least in a very long time) at generating video. Here I'm generating raw RGB frames in memory and writing them to ffmpeg, which works well enough but it's a little primitive.

At 50 year sold and very stable, C must be one of the easiest languages to get working on old machines. Required just some of the polyfills I wrote back in 2020.

My original solution checked every character against every other character, which performed perfectly fine even for 14 chars, but it felt wrong.

- C -

First a straightforward solution with a double buffer, later realised you could do it in-place by just holding onto one value per row/column.

First wrote a short AWK program to convert the input to C and play with it while running a hopeless brute force attempt.