# Union Find with Path Compression (Practice 5054): Sketch
Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note.
## Approach
Find compresses to the root; union by rank keeps the trees shallow.
```python
def accounts(n,edges):
p=list(range(n));r=[0]*n
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: continue
if r[ra]
elif r[ra]>r[rb]: p[rb]=ra
else: p[rb]=ra;r[ra]+=1
```
## 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.