PROBLEMS/TRIES
Tries LeetCode Problems
39 hand-tagged Tries problems across 1 interview pattern (Trie Construction / Prefix Search), ranked by importance (how often each pattern shows up in real coding interviews). Work top-down within each pattern.
| # | PROBLEM | DIFF | ELO | IMP | PATTERNS |
|---|---|---|---|---|---|
| 1 | Implement Trie (Prefix Tree) | Easy | 1377 | 90 | |
| 2 | Design Add and Search Words Data Structure | Medium | 1573 | 82 | Path Finding with Backtracking |
| 3 | Word Search II | Hard | 1907 | 82 | Path Finding with Backtracking |
| 4 | Implement Trie II (Prefix Tree)PREMIUM | Medium | 1412 | 72 | Frequency Counting / Hash Map Lookup |
| 5 | Search Suggestions System | Medium | 1573 | 67 | Boundary Finding (Bisect Left/Right) · Sorting + Comparison |
EVERY PATTERN
// your mastery
What's your Tries tier?
leaps.gg syncs your LeetCode history and scores your mastery of every pattern, then recommends the exact problems to do next with spaced repetition. Free to start.
GET MY MASTERY MAP →