Disjoint Set Union (DSU)

Definition

A data structure that keeps track of elements partitioned into disjoint (non-overlapping) sets. It supports two operations: Find (determine which set an element belongs to) and Union (merge two sets). With path compression, operations are nearly O(1).

Explain Like I'm New

Checking if two people are in the same friend group, and if two friend groups merge at a party, instantly updating everyone's group name.

Interactive Coding Challenges

Define the core structure for Union Find.

Solution Code

Console output will appear here...