452. Minimum Number of Arrows to Burst Balloons | LeetCode | Top Interview 150 | Coding Questions

class Solution {
    public int findMinArrowShots(int[][] points) {

        int n = points.length;
        if (n == 0) return 0;
        Arrays.sort(points, (a, b) -> Integer.compare(a[1], b[1]));

        int arrows = 1;
        int end = points[0][1];

        for (int i = 1; i < n; i++) {
            if (points[i][0] > end) {
                arrows++;
                end = points[i][1];
            }
        }

        return arrows;
    }
}