Tootfinder

I'm so glad I'm writing the solutions in both #nim and Python because I tend to find ways to improve the Python solution with the Nim one and vice versa. Today was one of those days. The biggest thing I learned though is that solving these damned puzzles exhausted will never lead to good things quality-wise.
Solution:

Once I pulled my head out of my ass this wasn't horrible. Part 1 was straightforward, decided to do some set stuff and managed to get it right the first time. Part 2 made my brain hurt a bit because all of the ideas that came to me were very, very slow and memory intensive. Then decided to scrap it and just do what the directions told me to do: count the paths...so I replaced the dumb with a dictionary which was so much better as an idea.
Solution:

This one took a smidge more thought as I can't abuse `zip` to rotate 2D sequences. However, just rewrote the rotation as a proc and used that. Instead of `reduce`, it was all `foldl`, and I fought with `char` vs `string` due to some of the processing operations between the normal and cephalopod problem processing.
Overall, definitely a fun solve.
Solution:

This took waaaay too long because I kept overlooking a glaring mistake at the range reduction algorithm, but once I saw it things went much more smoothly.
The #nim solution actually optimizes the range reduction step and comes in under a millisecond to execute which was nice.
Solution:

This one was disturbingly easy for Part 1, then got more fun on Part 2. The name of the game is rotations, and rotating the input was the key to getting it done without too much bother.
Solution: https://git.jamesthebard.net/jweatherly/advent-of-co…