Hey 👋

I’ve just published Part 2 of my Advent of Code 2025 write-up, covering days 7–12.

This part was significantly harder than the first one — I worked through graph traversal, memoization, bitmasking with BigInt, and even a full backtracking placement algorithm. Some days I solved completely, others I’ll definitely revisit later.

If you enjoy reading about how solutions evolve (not just final answers), you might find this useful.

Keep Reading

No posts found