Redundant connection: find the extra edge
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.
AppleTechnical phone screenNo answer yet. Write the first one; the best answer gets endorsed.