LeetCode 684 Redundant Connection - Why Naive Fails

Try removing each edge and check if the remaining graph is a tree (connected with no cycles).

For each of $n$ edges, checking connectivity takes $O(n)$. Total: $O(n^2)$.

Can you detect the cycle-forming edge as you process edges?