# Merge Intervals Sort (Practice 4644): Walkthrough
Interviewers love merge intervals sort because it checks whether you can state the invariant before coding. Here is a compact rehearsal note.
## Approach
Sort by start, merge overlapping into the last kept interval.
```python
def merge(intervals):
intervals.sort()
out = [intervals[0]]
for a, b in intervals[1:]:
if a <= out[-1][1]: out[-1][1] = max(out[-1][1], b)
else: out.append([a, 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 [real-time interview help](https://www.linkjob.ai/interview-copilot/).