[Advent of Code 2021] Day 20 | Trench Map
Day 20 - Image "enhancement" algorithm where you have to track infinite pixels. The trick: you don't have to track infinite pixels 🤖 🎨…
Day 20 - Image "enhancement" algorithm where you have to track infinite pixels. The trick: you don't have to track infinite pixels 🤖 🎨…
Day 19 - Spatially complex problem until you abstract away the number of axes. It becomes a simple rotation + translation problem that you can brute force (if you don't mind waiting 15 minutes w/o optimization). Also, learned what a Manhattan distance means 🏙…
Day 18 - Snailfish apparently have math homework. I created a custom binary tree with some special properties, and brute forced part 2 with deep copies 🐟 🎄 🐟…
Day 17 - Basically a trajectory problem that you might see in physics/mechanics class. Brute force works well enough but I suspect there is a constant-time solution for this one 📈…
Day 16 - Complicated packet parsing (no actual networking) for arithmetic operations. Using a stack to keep track of nested operations 🧝…