TRI
Trie
Prefix-aware search for autocomplete, routing, and dictionaries
4 problems
Implement Trie (Prefix Tree)
The baseline insert and search implementation problem.
Design Add and Search Words Data Structure
Trie design extended with wildcard lookup.
Word Search II
Backtracking plus trie pruning to scale dictionary matching.
Replace Words
A compact trie use case for prefix replacement.