← Questions
Redundant connection: find the extra edge
0
I was asked this
No reports yet. Sign in to say where you were asked it.
A tree had one extra edge added, so the undirected graph now has exactly one cycle. Return the edge that can be removed to leave a tree; if several could, return the one that appears last in the input. Union-find over the edges finds it in one pass.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding