← Questions
Redundant connection in a directed graph
0
I was asked this
No reports yet. Sign in to say where you were asked it.
A rooted tree had one extra directed edge added. Given the edge list, return the edge to remove so the rest is a rooted tree again, taking the last such edge in the input when there are several. Cover both cases: a node with two parents, and a cycle.
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