Interview PrepTries

0% read · 0 of 30 topics

TriesDSA

Prefix Structures

0% read0 of 30 topics

1. Trie Basics0/9

Implement Trie II (Prefix Tree)Soon

Design Add and Search Words Data StructureSoon

Longest Word in DictionarySoon

Prefix and Suffix SearchSoon

Map Sum PairsSoon

Replace WordsSoon

Search Suggestions SystemSoon

Implement Trie (Prefix Tree)Soon

Number of Distinct SubstringsSoon

2. Prefix / Word Search0/5

Word SquaresSoon

Concatenated WordsSoon

Longest Word With All PrefixesSoon

Complete StringSoon

Phone DirectorySoon

3. Trie + Bitwise / XOR0/3

Maximum XOR SubarraySoon

Maximum Strong Pair XOR ISoon

Maximum Strong Pair XOR IISoon

4. Trie + String Processing0/7

Palindrome PairsSoon

Stream of CharactersSoon

Word Break IISoon

Add and Search WordSoon

Shortest Unique PrefixSoon

Auto-complete SystemSoon

Spell CheckerSoon

5. Trie + Backtracking0/2

BoggleSoon

Maximum Score Words Formed by LettersSoon

6. Advanced Trie0/4

Implement a Compressed TrieSoon

Implement a Radix TreeSoon

Design Search Autocomplete SystemSoon

Multi-pattern String Matching using TrieSoon

Implement Trie II (Prefix Tree)

This lesson is coming soon. Browse the rest of the Tries syllabus in the sidebar.