# Redundant Connection Detection (Practice 5074): Pattern
Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note.
## Approach
Process edges in order; the first edge whose endpoints already share a root closes the cycle.
```python
def find_redundant(edges):
p=list(range(len(edges)+1))
def f(x):
while p[x]!=x: p[x]=p[p[x]];x=p[x]
return x
for a,b in edges:
ra,rb=f(a),f(b)
if ra==rb: return [a,b]
p[ra]=rb
```
## Complexity
Linear in the dominant input size for the scan; heap/tree variants add a log factor.
## Interview pitfalls
State the invariant out loud, name the complexity, then code. Skipping the invariant is the usual fail mode.
## Practicing out loud
Narrate the approach, complexity and one edge case in under a minute. Disclosure: I work on Linkjob AI, a real-time interview assistant. If you want live practice help, see AI help for online coding assessments.