The hardest ever problem in Advent of Code involved an octree! https://adventofcode.com/2018/day/23

Becomes all the more relevant after watching the latest Veritasium video on xz utils backdoor: https://www.youtube.com/watch?v=aoag03mSuXQ

Manim

Second edition is available now: https://www.oreilly.com/library/view/designing-data-intensiv...

This is really nice but I see this works only for the current issue i.e. #8 and not for previous issues.

That's why this course is so important: https://missing.csail.mit.edu

For someone interested to try this out algorithmically: https://adventofcode.com/2018/day/17

Earlier on HN, much more detailed: https://news.ycombinator.com/item?id=45719829

Honorary mention: https://github.com/pytries/marisa-trie