Tries Problems
A trie (prefix tree) stores strings character by character, enabling fast prefix lookups. Used in autocomplete, spell checkers, and word search problems.
6 problems
| Title | Difficulty | Platform |
|---|---|---|
| Design Add and Search Words Data Structure | Medium | LeetCode |
| Palindrome Pairs | Hard | LeetCode |
| phone-directory | Hard | Other |
| Print Anagrams Together | Practice | Medium | GeeksforGeeks |
| Trie Data Structure | Medium | GeeksforGeeks |
| Word Break Problem | (Trie solution) | Medium | GeeksforGeeks |