3 subtopics · 10 problems
Disjoint Set Union (DSU)
Union-Find: track connected components with union by rank + path compression.
01Basic DSU
Standard DSU with path compression and union by rank.
1 easy3 medium1 hard
| Problem | Difficulty | Link |
|---|---|---|
| 1921CSending Messages | easy | Solve |
| 1167CNews Distribution | medium | Solve |
| 1829DGold Rush | medium | Solve |
| 1411CSet and Decrease | medium | Solve |
| 1881FMinimum Maximum Distance | hard | Solve |
02Weighted / Ranked DSU
DSU with extra info — track size, weight, or parity of edges.
2 medium1 hard
| Problem | Difficulty | Link |
|---|---|---|
| 722CDestroying Array | medium | Solve |
| 1290BIrreducible Anagrams | medium | Solve |
| 687DDividing Kingdom II | hard | Solve |
03DSU with Rollback
Undo union operations — useful for offline divide-and-conquer.
2 hard
| Problem | Difficulty | Link |
|---|---|---|
| 892EEnvy | hard | Solve |
| 813FBipartite Checking | hard | Solve |
Was this helpful?