Loading repovive.com/roadmaps/data-structures
Roadmaps
Data Structures
Union-Find
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
1
Intro
2
Basic Structure
3
Basic Union
4
Path Compression
5
Union by Rank
6
Union by Size
7
Complexity Analysis
8
Problem - Number of Connected Components
9
Connected Components Solution
10
Problem - Redundant Connection
11
Cycle Detection with Union-Find
12
Problem - Number of Provinces
13
Provinces Solution
14
Problem - Graph Valid Tree
15
Valid Tree Solution
16
Weighted Union-Find
17
Problem - Evaluate Division
18
Evaluate Division: Weighted UF
19
Evaluate Division Solution
20
Problem - Accounts Merge
21
Accounts Merge Approach
22
Accounts Merge Solution
23
Problem - Largest Component Size by Factor
24
Union by Prime Factors
25
Largest Component Solution
26
Problem - Swimming in Rising Water
27
Swimming Solution
28
Kruskal's Algorithm
29
Problem - Min Cost to Connect Points
30
Min Cost Solution
31
Union-Find with Rollback
32
Online vs Offline Problems
33
Common Union-Find Bugs
34
Quiz: Union-Find
35
Section Recap
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
10.1
Intro
2 minutes
100%
Tasks
Read Unit