3 ms·
Python Time Complexity
- ggm 2y agoMy personal fave structure remains the radix trie. But, I increasingly find that a dict/hash operates pretty damn well for the simple cases. The nice thing about a trie is how it finds the covering and more specific prefixes. Awk hashes are also dense and fast.