# Minimum Number of Arrows to Burst Balloons (Practice 5061): Brief
Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note.
## Approach
Sort by end coordinate; shoot at the current end and skip every balloon that starts before it.
```python
def find_min_arrows(points):
points.sort(key=lambda p:p[1]);arrows=0;end=float('-inf')
for s,e in points:
if s>end: arrows+=1;end=e
return arrows
```
## 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 https://www.linkjob.ai/.