Loading repovive.com/roadmaps/data-structures
Roadmaps
Data Structures
Tries
Problemset
Discussion
AI Helper
Arrays & Prefix Sums
0/50
Stacks & Monotonic Stacks
0/40
Queues & Deques
0/38
Hash Tables
0/40
Heaps & Priority Queues
0/43
Linked Lists
0/36
Binary Trees
0/35
Binary Search Trees
0/35
Tries
0/35
1
Intro
2
Trie Node Structure
3
Trie Insert Operation
4
Trie Search Operation
5
Prefix Search
6
Problem - Implement Trie
7
Trie Implementation
8
Implement Trie Solution
9
Counting Words with Prefix
10
Trie Deletion
11
Problem - Add and Search Word
12
Wildcard Search Strategy
13
Add and Search Solution
14
Problem - Word Search II
15
Word Search II: Trie Approach
16
Word Search II Optimizations
17
Word Search II Solution
18
Problem - Longest Word in Dictionary
19
Longest Word Solution
20
Compressed Tries (Radix Trees)
21
Suffix Tries and Suffix Trees
22
Problem - Maximum XOR of Two Numbers
23
Bitwise Trie Concept
24
Maximum XOR Solution
25
Problem - Search Autocomplete
26
Autocomplete Design
27
Autocomplete Solution
28
Problem - Replace Words
29
Replace Words Solution
30
Array vs Map Children
31
Trie Memory Optimization
32
Trie vs Hash Set
33
Counting Distinct Substrings
34
Quiz: Tries
35
Section Recap
Union-Find
0/35
Segment Trees
0/35
Fenwick Trees
0/35
Sparse Tables
0/35
Sqrt Decomposition
0/42
Advanced Trees
0/42
Interval Trees
0/40
Wavelet Trees
0/37
Link-Cut Trees
0/39
Persistent Data Structures
0/37
9.1
Intro
2 minutes
100%
Tasks
Read Unit