Loading repovive.com/roadmaps/data-structures
Roadmaps
Data Structures
Interval Trees
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
Advanced Trees
0/42
Interval Trees
0/40
1
Intro
2
Interval Representation
3
The Overlap Problem
4
Interval Tree Structure
5
Building the Tree
6
Point Query
7
Why Dual Sorting Works
8
Problem - Merge Intervals
9
Merge Intervals: Sorting Approach
10
Merge Intervals Solution
11
Problem - Insert Interval
12
Insert Interval Approach
13
Insert Interval Solution
14
Augmented BST Approach
15
Maintaining maxHigh
16
Overlap Search in Augmented BST
17
Finding All Overlaps
18
Problem - Meeting Rooms
19
Meeting Rooms Solution
20
Problem - Meeting Rooms II
21
Meeting Rooms II: Event Sweep
22
Meeting Rooms II: Heap Approach
23
Meeting Rooms II Solution
24
Problem - Range Module
25
Range Module: TreeMap Approach
26
Range Module Solution
27
Interval Scheduling Maximization
28
Problem - Non-overlapping Intervals
29
Non-overlapping Solution
30
Segment Tree for Intervals
31
Coordinate Compression
32
2D Interval Problems
33
Problem - Rectangle Area II
34
Rectangle Area: Sweep Line
35
Rectangle Area II Solution
36
Interval Tree vs Segment Tree
37
Stabbing Number Problem
38
Interval Partitioning
39
Quiz: Interval Trees
40
Section Recap
Wavelet Trees
0/37
Link-Cut Trees
0/39
Persistent Data Structures
0/37
16.1
Intro
2 minutes
100%
Tasks
Read Unit