DSA sheet · Topic
Tries interview problems
Prefix trees: storing many words so that prefix lookups, wildcard searches and grid word hunts become fast.
- 3 problems
- Java + Python
- Free, no sign-up
11 Tries Prefix trees: storing many words so that prefix lookups, wildcard searches and grid word hunts become fast. 0 / 3
- 95 Implement Trie (Prefix Tree) Medium Has notes Practice Implement Trie (Prefix Tree) on LeetCode (opens in a new tab)
- 96 Design Add and Search Words Data Structure Medium Has notes Practice Design Add and Search Words Data Structure on LeetCode (opens in a new tab)
- 97 Word Search II Hard Has notes Practice Word Search II on LeetCode (opens in a new tab)
No problems match these filters.