Tag: trie
- Add Bold Tag in String
- Bold Words in String
- Camelcase Matching
- Concatenated Words
- Count Pairs With XOR in a Range
- Count Prefix and Suffix Pairs I
- Count Prefix and Suffix Pairs II
- Delete Duplicate Folders in System
- Design Add and Search Words Data Structure
- Design File System
- Design In-Memory File System
- Design Search Autocomplete System
- Distinct Echo Substrings
- Encrypt and Decrypt Strings
- Extra Characters in a String
- Find the Length of the Longest Common Prefix
- Implement Magic Dictionary
- Implement Trie II (Prefix Tree)
- Implement Trie (Prefix Tree)
- Index Pairs of a String
- K Divisible Elements Subarrays
- K-th Smallest in Lexicographical Order
- Lexicographical Numbers
- Longest Common Prefix of K Strings After Removal
- Longest Common Prefix
- Longest Common Suffix Queries
- Longest Word in Dictionary
- Longest Word With All Prefixes
- Map Sum Pairs
- Maximum Genetic Difference Query
- Maximum Strong Pair XOR I
- Maximum Strong Pair XOR II
- Maximum XOR of Two Non-Overlapping Subtrees
- Maximum XOR of Two Numbers in an Array
- Maximum XOR With an Element From Array
- Minimum Cost to Convert String II
- Minimum Number of Valid Strings to Form Target I
- Number of Distinct Substrings in a String
- Number of Matching Subsequences
- Number of Valid Words for Each Puzzle
- Palindrome Pairs
- Phone Number Prefix
- Prefix and Suffix Search
- Remove Sub-Folders from the Filesystem
- Replace Words
- Search Suggestions System
- Short Encoding of Words
- Shortest Uncommon Substring in an Array
- Stream of Characters
- Sum of Prefix Scores of Strings
- Top K Frequent Words
- Word Abbreviation
- Word Break II
- Word Break
- Word Search II
- Word Squares
- Words Within Two Edits of Dictionary