Minimum Arrows for Overlapping Intervals

MediumPython

Problem

Given an array of intervals points, where each interval is [start, end], return the minimum number of arrows required to cover all intervals. One arrow shot at position x covers every interval such that start <= x <= end.

Constraints

1 <= len(points) <= 10^5
points[i].length == 2
-2^31 <= start < end <= 2^31 - 1

Function Signature

def find_min_arrows(points):

CodePython 3

Run your code to see test output here.