Skip to interview prep
Apexed

214. Implement union-find with union by rank and path compression, and use it to detect a cycle in an undirected graph.

MediumDisjoint sets

Technical

Write a solution in JavaScript or Python, add a few test calls that print results and press Run. This is ungraded practice: Run shows output and does not check correctness. Open the Model answer tab to compare. Your code is saved in this browser.

Tab indents · Ctrl/⌘ + Enter runs · Esc then Tab leaves the editor

Press Run to see your program’s output.

Implement union-find with union by rank and path compression, and use it to detect a cycle in an undirected graph. — Data structures & algorithms interview ques