Redundant connection in a directed graph
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.
MicrosoftCodingNo answer yet. Write the first one; the best answer gets endorsed.