Loading repovive.com/roadmaps/data-structures
Roadmaps
Data Structures
Queues & Deques
Problemset
Discussion
AI Helper
Arrays & Prefix Sums
0/50
Stacks & Monotonic Stacks
0/40
Queues & Deques
0/38
1
Intro
2
Vocabulary - Queue
3
Queue Visualization
4
Queue Implementation
5
Where Queues Shine
6
BFS Overview
7
Problem - Number of Recent Calls
8
Recent Calls - Algorithm
9
Recent Calls - Implementation
10
Lessons from Recent Calls
11
Quiz: Queue Basics
12
The Limitation of Queues
13
Vocabulary - Deque
14
Deque Implementation
15
The Sliding Window Maximum
16
Vocabulary - Monotonic Deque
17
Why Monotonic Deque Works
18
Monotonic Deque Visualization
19
Problem - Sliding Window Maximum
20
Sliding Max - Algorithm
21
Sliding Max - Implementation
22
Lessons from Sliding Max
23
Quiz: Monotonic Deque
24
Sliding Window Minimum
25
A Harder Problem
26
Shortest Subarray - The Idea
27
Shortest Subarray - Algorithm
28
Shortest Subarray - Implementation
29
Lessons from Shortest Subarray
30
Quiz: Deque vs Stack vs Queue
31
Deque vs Two Stacks
32
When to Use Deques
33
Problem - Constrained Subsequence Sum
34
Constrained Sum - DP Formulation
35
Constrained Sum - Implementation
36
Lessons from Constrained Sum
37
Quiz: DP Optimization
38
Section Recap
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
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
3.1
Intro
2 minutes
100%
Tasks
Read Unit