Skip to content

Topic: Trie

44 problems
TitleStatusDifficulty
Longest Common Prefix—Easy
Word Break—Medium
Word Break II—Hard
Implement Trie (Prefix Tree)—Medium
Design Add and Search Words Data Structure—Medium
Word Search II—Hard
Palindrome Pairs—Hard
Lexicographical Numbersread—Medium
Maximum XOR of Two Numbers in an Array—Medium
K-th Smallest in Lexicographical Order—Hard
Concatenated Words—Hard
Replace Words—Medium
Implement Magic Dictionaryread—Medium
Map Sum Pairs—Medium
Top K Frequent Words—Medium
Longest Word in Dictionary—Medium
Prefix and Suffix Search—Hard
Number of Matching Subsequences—Medium
Short Encoding of Words—Medium
Camelcase Matching—Medium
Stream of Charactersread—Hard
Number of Valid Words for Each Puzzle—Hard
Remove Sub-Folders from the Filesystem—Medium
Search Suggestions System—Medium
Distinct Echo Substrings—Hard
Maximum XOR With an Element From Array—Hard
Count Pairs With XOR in a Rangeread—Hard
Maximum Genetic Difference Query—Hard
Delete Duplicate Folders in Systemread—Hard
Encrypt and Decrypt Strings—Hard
K Divisible Elements Subarrays—Medium
Sum of Prefix Scores of Strings—Hard
Words Within Two Edits of Dictionary—Medium
Extra Characters in a String—Medium
Maximum Strong Pair XOR I—Easy
Maximum Strong Pair XOR II—Hard
Minimum Cost to Convert String IIread—Hard
Count Prefix and Suffix Pairs I—Easy
Find the Length of the Longest Common Prefix—Medium
Count Prefix and Suffix Pairs II—Hard
Shortest Uncommon Substring in an Array—Medium
Longest Common Suffix Queries—Hard
Minimum Number of Valid Strings to Form Target I—Medium
Longest Common Prefix of K Strings After Removalread—Hard