Union-Find (Disjoint Set Union)

Union by size or rank, path compression, the inverse Ackermann bound, DSU with extra data, and what DSU cannot do.

0 / 8 solved

Question Tags Difficulty Success

Data Structures

Easy 73%

union-findunion-by-size +1

Medium —

union-finddebugging +1

Medium —

union-findpath-compression +1

Medium —

union-findunion-by-size +1

Medium —

union-findinverse-ackermann +1

Medium —

union-findbipartite +2

Hard —

union-findrollback +2

Hard —

8 of 8 questions here are still unsolved.