Loading repovive.com/roadmaps/data-structures
Roadmaps
Data Structures
Arrays & Prefix Sums
Problemset
Discussion
AI Helper
Arrays & Prefix Sums
0/50
1
Intro
2
Array Fundamentals
3
The Range Sum Problem
4
Vocabulary - Prefix Sum
5
The Core Idea
6
Visualization
7
Problem - Range Sum Query
8
Range Sum - Building the Array
9
Range Sum - Answering Queries
10
Range Sum - Implementation
11
Lessons from Range Sum
12
Quiz: Prefix Sum Basics
13
Extending to 2D
14
Vocabulary - 2D Prefix Sum
15
2D Prefix - The Formula
16
2D Prefix - Building
17
Problem - 2D Range Sum
18
2D Range Sum - Build
19
2D Range Sum - Query
20
Lessons from 2D Prefix
21
Quiz: 2D Prefix Sums
22
The Range Update Problem
23
Vocabulary - Difference Array
24
Difference Array Insight
25
Difference Array Visualization
26
Problem - Range Addition
27
Range Addition - Algorithm
28
Range Addition - Implementation
29
Lessons from Difference Arrays
30
Quiz: Difference Arrays
31
The Pair Finding Problem
32
Vocabulary - Two Pointers
33
Two Pointers Logic
34
Problem - Two Sum Sorted
35
Two Sum Sorted - Why It Works
36
Two Sum Sorted - Implementation
37
Lessons from Two Pointers
38
Quiz: Two Pointers
39
The Subarray Problem
40
Vocabulary - Sliding Window
41
Fixed Window Pattern
42
Problem - Maximum Average Subarray
43
Max Average - Implementation
44
Variable Window Pattern
45
Problem - Longest Substring
46
Longest Substring - The Idea
47
Longest Substring - Implementation
48
Lessons from Sliding Window
49
Quiz: Sliding Window
50
Section Recap
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
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
1.1
Intro
2 minutes
100%
Tasks
Read Unit