Trie Problems
Less than 1 minute
Trie Problems
No. | Title | Solution | Tags | Difficulty |
---|---|---|---|---|
0208 | Implement Trie (Prefix Tree) | [[LeetCode 0208]] | Design, Trie, Hash Table, String | Medium |
0677 | Map Sum Pairs | [[LeetCode 0677]] | Design, Trie, Hash Table, String | Medium |
0648 | Replace Words | [[LeetCode XXXX]] | Trie, Array, Hash Table, String | Medium |
0642 | Design Search Autocomplete System | [[LeetCode XXXX]] | Design, Trie, String, Data Stream | Hard |
0211 | Design Add and Search Words Data Structure | [[LeetCode XXXX]] | Depth-First Search, Design, Trie, String | Medium |
0421 | Maximum XOR of Two Numbers in an Array | [[LeetCode XXXX]] | Bit Manipulation, Trie, Array, Hash Table | Medium |
0212 | Word Search II | [[LeetCode 0212]] | Trie, Array, String, Backtracking, Matrix | Hard |
0425 | Word Squares | [[LeetCode XXXX]] | Trie, Array, String, Backtracking | Hard |
0336 | Palindrome Pairs | [[LeetCode XXXX]] | Trie, Array, Hash Table, String | Hard |
1023 | Camelcase Matching | [[LeetCode XXXX]] | Trie, Two Pointers, String, String Matching | Medium |
0676 | Implement Magic Dictionary | [[LeetCode XXXX]] | Design, Trie, Hash Table, String | Medium |
0440 | K-th Smallest in Lexicographical Order | Trie | Hard |