Union-Find
Tracking which items are connected as you merge groups — in near-constant time per operation.
This topic is part of Pro.
Free covers the C and Python courses, the first three DSA topics, the opening system design lessons and the beginner AI lessons, all with the full coach. Pro opens the rest of the library in the FollowtheDamnCode app.
What is in it
- 1Disjoint setsA parent array where each group is a tree and its root is the group's name. Pro
- 2Path compression and union by sizeTwo small changes keep the trees almost flat, making every operation effectively constant time. Pro
- 3Union-find in problemsRedundant edges, valid trees, merging accounts, and grids — and when DFS is the simpler choice. Pro