Loading repovive.com/roadmaps/data-structures
Roadmaps
Data Structures
Hash Tables
Problemset
Discussion
AI Helper
Arrays & Prefix Sums
0/50
Stacks & Monotonic Stacks
0/40
Queues & Deques
0/38
Hash Tables
0/40
1
Intro
2
Vocabulary - Hash Table
3
How Hashing Works
4
Hash Table Operations
5
Hash Set vs Hash Map
6
Pattern - Frequency Counting
7
Frequency Counting Applications
8
Problem - Valid Anagram
9
Valid Anagram - Algorithm
10
Valid Anagram - Implementation
11
Lessons from Valid Anagram
12
Quiz: Frequency Counting
13
The Pair Finding Problem
14
Pattern - Complement Lookup
15
Problem - Two Sum
16
Two Sum - Algorithm
17
Two Sum - Implementation
18
Lessons from Two Sum
19
Quiz: Two Sum Pattern
20
Problem - Group Anagrams
21
Group Anagrams - Key Design
22
Group Anagrams - Implementation
23
Lessons from Group Anagrams
24
Combining Techniques
25
The Core Idea
26
Problem - Subarray Sum Equals K
27
Subarray Sum - Algorithm
28
Subarray Sum - Why Initialize with 0
29
Subarray Sum - Implementation
30
Lessons from Subarray Sum
31
Quiz: Prefix Sum + Hash
32
A Harder Problem
33
Longest Consecutive - The Idea
34
Longest Consecutive - Algorithm
35
Longest Consecutive - Implementation
36
Lessons from Longest Consecutive
37
Quiz: Hash Set Usage
38
When Hashing Fails
39
Recognizing Hash Problems
40
Section Recap
Heaps & Priority Queues
0/43
Linked Lists
0/36
Binary Trees
0/35
Binary Search Trees
0/35
Tries
0/35
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
4.1
Intro
2 minutes
100%
Tasks
Read Unit