Union-Find / Disjoint Set

The Union-Find / Disjoint Set technique is applied when tackling problems characterized by specific invariants in the problem state or constraints:

• Core Strategy: Maintain disjoint sets with union and find operations to detect connectivity or cycles as edges are processed.
• When to use: Look for opportunities where repeated re-computation can be replaced by maintaining monotonic properties, state windows, or relational pointers.
• Interview Signal: Demonstrating this pattern shows mastery of Graphs foundations, reducing worst-case algorithmic complexity.