Minimum arrows burst balloons
Spherical balloons are taped to a wall, each spanning a horizontal closed interval [xstart, xend]. An arrow shot upward at coordinate x bursts every balloon whose interval contains x (xstart <= x <= xend); arrows travel infinitely high. Return the minimum number of arrows needed to burst all balloons.
Implement
find_min_arrows(points: list[list[int]]) → intExamples
in
[[[10,16],[2,8],[1,6],[7,12]]]out2What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[[[10,16],[2,8],[1,6],[7,12]]]2not run yetsample