Skip to content
Log inStart studying

DSA learning path

Union-Find

Disjoint sets, component counting and incremental connectivity.

Start with Count Connected Components

Problems in this path

  1. Count Connected Components
    Medium · Disjoint Set Union
    Open
  2. Find a Redundant Connection
    Medium · Cycle Detection with DSU
    Open
  3. Earliest Full Connection
    Hard · Offline DSU
    Open
  4. Count Provinces
    Easy · DSU on Adjacency Matrix
    Open
  5. Satisfiability of Equality Equations
    Medium · Two-Pass DSU
    Open
  6. Smallest String with Allowed Swaps
    Medium · DSU Component Sorting
    Open
  7. Connect a Computer Network
    Medium · Spare-Edge DSU
    Open
  8. Remove Connected Stones
    Hard · Bipartite DSU
    Open
  9. Dynamic Island Counts
    Hard · Incremental Grid DSU
    Open
  10. Merge Accounts by Shared Email
    Hard · DSU Identity Merge
    Open

Read first

Union-Find for Dynamic Connectivity

Maintain disjoint components with path compression and union by size, then apply the structure to cycles, spanning trees and offline events.

16 min read