# Merge Intervals Sort (Practice 5052): Rehearsal
Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note.
## Approach
Sort by start, then extend or append as each interval overlaps the last kept one.
```python
def merge(iv):
iv.sort();out=[]
for s,e in iv:
if not out or s>out[-1][1]: out.append([s,e])
else: out[-1][1]=max(out[-1][1],e)
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 interview copilot app.