# Accounts Merge by Email (Practice 5073): Notes

Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note.

## Approach

Union emails that share an account, then group by root and sort.

```python
def accounts_merge(accts):
p={};owner={}
def f(x):
p.setdefault(x,x)
while p[x]!=x: p[x]=p[p[x]];x=p[x]
return x
for a in accts:
for e in a[1:]: owner[e]=a[0];p[f(e)]=f(a[1])
groups={}
for e in owner: groups.setdefault(f(e),[]).append(e)
return [[owner[r]]+sorted(v) for r,v in groups.items()]
```

## 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 here.