As a SQLite and Rust fan I really enjoyed this episode. 😀 Thanks!

It's deceptive, try some of the most obvious tests/solutions

Found a general solution after a fresh look a couple of hours later: working backwards, storing intermediary results in a dictionary (hash map) for reuse. Almost as fast as the fine tuned first version.

Had to plot the graph and fit the algorithm to its specifics

Happy birthday & and thanks for all the amazing content! 🥳

I've just stumbled upon your blog and am currently going through the #Zig HashMap posts: fantastic stuff, thanks a lot! 👍