Loading repovive.com/roadmaps/data-structures
Roadmaps
Data Structures
Sqrt Decomposition
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
Union-Find
0/35
Segment Trees
0/35
Fenwick Trees
0/35
Sparse Tables
0/35
Sqrt Decomposition
0/42
1
Intro
2
The Core Idea
3
Vocabulary - Block Size
4
Quiz: Block Index
5
Building Block Sums
6
Range Sum Query
7
Range Sum - Implementation
8
Point Updates
9
Point Update - Implementation
10
Problem - Range Sum Queries I
11
Range Sum I - Analysis
12
Range Sum I - Implementation
13
Lessons from Range Sum
14
Range Minimum Query
15
Range Min - Update Challenge
16
Quiz: Update Complexity
17
When to Use Sqrt Decomposition
18
MO's Algorithm - Introduction
19
MO's Sorting Order
20
MO's Algorithm - Framework
21
Problem - Distinct Values
22
Distinct Values - Add/Remove
23
Distinct Values - Implementation
24
Lessons from Distinct Values
25
MO's with Expensive Operations
26
Problem - Mode Query
27
Mode Query - Data Structures
28
Mode Query - Implementation
29
Lessons from Mode Query
30
MO's Optimization - Zigzag Order
31
Quiz: MO's Complexity
32
Block Decomposition for Updates
33
Lazy Block Updates
34
Problem - Polynomial Queries
35
Polynomial Queries - Analysis
36
Polynomial Queries - Pushdown
37
Lessons from Polynomial Queries
38
MO's with Updates
39
MO's with Updates - Analysis
40
Comparing Sqrt to Other Structures
41
Challenge: Design Your Solution
42
Section Recap
Advanced Trees
0/42
Interval Trees
0/40
Wavelet Trees
0/37
Link-Cut Trees
0/39
Persistent Data Structures
0/37
14.1
Intro
3 minutes
100%
Tasks
Read Unit