# Merge Intervals Sort (Practice 5030): Sketch
Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note.
## Approach
sort then fold overlap.
```python
def merge(intervals):
intervals.sort()
out=[]
for a,b in intervals:
if not out or out[-1][1]<a: out.append([a,b])
else: out[-1][1]=max(out[-1][1],b)
return out
```
## 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 [Linkjob AI copilot](https://www.linkjob.ai/).