1. Trie Basics and Operations
· Implement a Trie (Insert, Search, Delete)
· Implement a TrieNode Class
· Insert a Word into a Trie
· Search for a Word in a Trie
· Delete a Word from a Trie
· Check if a Prefix Exists in a Trie
· Count Words in a Trie
· Count Prefixes in a Trie
· Implement a Trie with Case Sensitivity
· Implement a Trie with Case Insensitivity
2. Trie-Based String Operations
· Find All Words with a Given Prefix (Using Trie)
· Find Words that Start with a Given Prefix (Using Trie)
· Find All Words that End with a Given Suffix (Using Trie)
· Find Longest Prefix Matching a Given String
· Find the Shortest Unique Prefix for Each Word
· Find All Words that Match a Given Pattern (Using Wildcards)
· Implement a Trie to Solve the Autocomplete Problem
· Find the Longest Common Prefix Among a List of Words
· Implement a Trie for Text Search and Replacement
· Find the Longest Common Suffix Among a List of Words
3. Advanced Trie Problems
· Implement a Trie with Node Counting
· Implement a Trie with Value Mapping (Key-Value Pair Storage)
· Implement a Trie with Frequency Counting
· Find the Number of Words with a Specific Prefix
· Find the Number of Words with a Specific Suffix
· Implement a Trie for Dictionary Word Lookup
· Find the Longest Prefix of a Word in a Trie
· Find the Maximum Number of Words in a Trie that Share a Prefix
· Find the Shortest Path from Root to a Given Word in a Trie
· Implement a Trie with a TrieMap (Word Count Mapping)
4. Trie and Text Processing
· Implement a Trie-based spell Checker
· Implement a Trie for Dictionary-Based Text Completion
· Find All Possible Words that Can Be Formed from a Given Set of Letters (Using Trie)
· Implement a Trie-based solution for Word Segmentation
· Implement a Trie to Solve the Word Break Problem
· Find All Valid Words in a Board Using Trie (Word Search II)
· Find the Maximum Number of Words Formed from a Given List (Using Trie)
· Implement a Trie-based solution for Text Search with Wildcards
· Implement a Trie to Solve the Text Justification Problem
· Find the Most Frequent Prefixes in a Large Text Dataset (Using Trie)
5. Trie-Based Algorithms
· Implement a Trie-Based Algorithm for Prefix Matching
· Implement a Trie-Based Algorithm for Suffix Matching
· Find the Minimum Number of Edits to Convert One Word to Another (Using Trie)
· Find the Maximum Length of a Prefix with a Given Frequency (Using Trie)
· Implement a Trie-Based Algorithm for Finding Palindromic Substrings
· Find the Number of Distinct Substrings in a given string (Using Trie)
· Implement a Trie-Based Algorithm for Pattern Matching with Multiple Patterns
· Find the Longest Palindromic Substring in a Trie
· Find the Kth Largest Prefix in a Trie
· Implement a Trie-Based Algorithm for Longest Repeating Substring
Source link
lol
