Advent of Code Day 16 (Worked Solution for Parts 1 and 2)
This was a fun AOC problem with a reasonably simple recursive solution to it. Basically you shoot out a laser beam and it bounces around the world, and you write down which squares it touches. The main thing is to make sure you don't fall into any infinite loops, so always get your base cases sorted out before going too deep into it.