Loading repovive.com/roadmaps/data-structures
Roadmaps
Data Structures
Heaps & Priority Queues
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
1
Intro
2
Vocabulary - Heap
3
Heap Visualization
4
Array Representation
5
Heap Operations Overview
6
Insert Operation
7
Extract Operation
8
Bubble Down Details
9
Vocabulary - Priority Queue
10
Using Built-in Heaps
11
Quiz: Heap Basics
12
Problem - Last Stone Weight
13
Last Stone - Algorithm
14
Last Stone - Implementation
15
Lessons from Last Stone
16
The K-th Element Problem
17
K-th Largest with Min-Heap
18
Problem - Kth Largest Element
19
Kth Largest - Algorithm
20
Kth Largest - Implementation
21
Lessons from Kth Largest
22
Quiz: K-th Element
23
Problem - Top K Frequent Elements
24
Top K Frequent - Algorithm
25
Top K Frequent - Implementation
26
Lessons from Top K Frequent
27
The Merge Problem
28
K-Way Merge with Heap
29
Problem - Merge K Sorted Lists
30
Merge K Lists - Implementation
31
Lessons from Merge K Lists
32
Quiz: K-Way Merge
33
The Median Problem
34
Two Heaps Technique
35
Two Heaps Visualization
36
Problem - Find Median from Data Stream
37
Median Stream - Invariants
38
Median Stream - Implementation
39
Lessons from Median Stream
40
Quiz: Two Heaps
41
When to Use Heaps
42
Heap vs Sorting
43
Section Recap
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
5.1
Intro
2 minutes
100%
Tasks
Read Unit