Problems/Union Find / DSU

Union Find / DSU

Track connected components dynamically. Essential for graph connectivity, Kruskal's, and island-counting problems.

13Total

12Ready

1Number of Connected Components

2Number of Islands

3Graph Valid Tree

4Accounts Merge

5Satisfiability of Equality Equations

6Lexicographically Smallest Equivalent String

7Similar String Groups

1Number of Provinces

2Redundant ConnectionSoon

3Surrounded Regions

4Longest Consecutive Sequence

5Max Area of Island

6Evaluate Division