← back

Trie

46 questions · 0 seen

All Trie problems

Problems

14 Longest Common Prefix
139 Word Break
140 Word Break II
208 Implement Trie (Prefix Tree)
211 Design Add and Search Words Data Structure
212 Word Search II
336 Palindrome Pairs
386 Lexicographical Numbers
421 Maximum XOR of Two Numbers in an Array
440 K-th Smallest in Lexicographical Order
472 Concatenated Words
648 Replace Words
676 Implement Magic Dictionary
677 Map Sum Pairs
692 Top K Frequent Words
720 Longest Word in Dictionary
745 Prefix and Suffix Search
792 Number of Matching Subsequences
820 Short Encoding of Words
1023 Camelcase Matching
1032 Stream of Characters
1178 Number of Valid Words for Each Puzzle
1233 Remove Sub-Folders from the Filesystem
1268 Search Suggestions System
1316 Distinct Echo Substrings
1707 Maximum XOR With an Element From Array (PRO)
1803 Count Pairs With XOR in a Range (PRO)
1938 Maximum Genetic Difference Query (PRO)
1948 Delete Duplicate Folders in System (PRO)
2227 Encrypt and Decrypt Strings
2261 K Divisible Elements Subarrays (PRO)
2416 Sum of Prefix Scores of Strings
2452 Words Within Two Edits of Dictionary (PRO)
2707 Extra Characters in a String
2932 Maximum Strong Pair XOR I
2935 Maximum Strong Pair XOR II
2977 Minimum Cost to Convert String II
3042 Count Prefix and Suffix Pairs I
3043 Find the Length of the Longest Common Prefix
3045 Count Prefix and Suffix Pairs II
3076 Shortest Uncommon Substring in an Array
3093 Longest Common Suffix Queries
3291 Minimum Number of Valid Strings to Form Target I
3485 Longest Common Prefix of K Strings After Removal
3597 Partition String
3845 Maximum Subarray XOR with Bounded Range