Topic 20 of 21
Trie Problems
Implement a trie, count distinct substrings and solve maximum XOR problems with a bitwise trie.
7 trie problems (2 medium, 5 hard) with LeetCode and GeeksforGeeks links.
Your progress
– / 7 solved
- Easy
- –/0
- Medium
- –/2
- Hard
- –/5
/
- Implement Trie | Insert | Search | startsWithHardGFG
- Implement Trie - 2 (Prefix Tree)HardLeetCode
- Longest String with All PrefixesMediumGFG
- Number of Distinct Substrings in a StringHardLeetCodeGFG
- Bit Prerequisites for Trie ProblemsHard
- Maximum XOR of Two Numbers in an ArrayMediumLeetCodeGFG
- Maximum XOR with an Element from ArrayHardLeetCodeGFG