# Redundant Connection: Practice Notes
Redundant Connection shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
The graph is a tree plus one extra edge. Union-Find the edges in order; the first edge whose two ends already share a parent is the redundant one (the problem asks for the last such edge in input order, which Union-Find reports naturally).
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n α(n)).
## Common mistake
DFS from scratch after each edge, or returning any cycle edge instead of the one that appears last in the input.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at multilingual AI interview assistant.