This solution reminds me of an old blog post, where two members of the F# team at Microsoft battled back and forth on making the best solver for some word game.

This solution reminds me of an old blog post, where two members of the F# team at Microsoft battled back and forth on making the best solver for some word game. Cloudflare's solution here looks a lot like the second-to-last solution; the final post involved collapsing the tree nodes into a 2D array of u32s for maximum cache-hits. It was a really neat solution! ...and amazingly, it's still up from 2010: https://lorgonblog.wordpress.com/2010/02/21/dawg-gone/ https://lorgonblog.wordpress.com/2010/02/21/dawg-gone/