## Algorithm

Problem Name: 452. Minimum Number of Arrows to Burst Balloons

There are some spherical balloons taped onto a flat wall that represents the XY-plane. The balloons are represented as a 2D integer array `points` where `points[i] = [xstart, xend]` denotes a balloon whose horizontal diameter stretches between `xstart` and `xend`. You do not know the exact y-coordinates of the balloons.

Arrows can be shot up directly vertically (in the positive y-direction) from different points along the x-axis. A balloon with `xstart` and `xend` is burst by an arrow shot at `x` if `xstart <= x <= xend`. There is no limit to the number of arrows that can be shot. A shot arrow keeps traveling up infinitely, bursting any balloons in its path.

Given the array `points`, return the minimum number of arrows that must be shot to burst all balloons.

Example 1:

```Input: points = [[10,16],[2,8],[1,6],[7,12]]
Output: 2
Explanation: The balloons can be burst by 2 arrows:
- Shoot an arrow at x = 6, bursting the balloons [2,8] and [1,6].
- Shoot an arrow at x = 11, bursting the balloons [10,16] and [7,12].
```

Example 2:

```Input: points = [[1,2],[3,4],[5,6],[7,8]]
Output: 4
Explanation: One arrow needs to be shot for each balloon for a total of 4 arrows.
```

Example 3:

```Input: points = [[1,2],[2,3],[3,4],[4,5]]
Output: 2
Explanation: The balloons can be burst by 2 arrows:
- Shoot an arrow at x = 2, bursting the balloons [1,2] and [2,3].
- Shoot an arrow at x = 4, bursting the balloons [3,4] and [4,5].
```

Constraints:

• `1 <= points.length <= 105`
• `points[i].length == 2`
• `-231 <= xstart < xend <= 231 - 1`

## Code Examples

### #1 Code Example with Java Programming

```Code - Java Programming```

``````
class Solution {
public int findMinArrowShots(int[][] points) {
Arrays.sort(points, Comparator.comparingInt((int[] o) -> o));
int count = 0;
int idx = 0;
while (idx < points.length) {
int currEnd = points[idx];
while (idx < points.length && points[idx] <= currEnd) {
idx++;
}
count++;
}
return count;
}
}
``````
Copy The Code &

Input

cmd
points = [[10,16],[2,8],[1,6],[7,12]]

Output

cmd
2

### #2 Code Example with Javascript Programming

```Code - Javascript Programming```

``````
const findMinArrowShots = function(points) {
const sorted = points.sort((a, b) => a - b)
let ans = 0
let lastX = null
for (let i = 0; i < sorted.length; i += 1) {
if (lastX && sorted[i] <= lastX) {
lastX = Math.min(sorted[i], lastX)
} else {
ans += 1
lastX = sorted[i]
}
}
return ans
}
``````
Copy The Code &

Input

cmd
points = [[10,16],[2,8],[1,6],[7,12]]

Output

cmd
2

### #3 Code Example with Python Programming

```Code - Python Programming```

``````
class Solution:
def findMinArrowShots(self, p):
p.sort(key = lambda x: x)
(res, curr) = (1, p) if p else (0, None)
for n in p:
if n > curr: res, curr = res + 1, n
return res
``````
Copy The Code &

Input

cmd
points = [[1,2],[3,4],[5,6],[7,8]]

Output

cmd
4

### #4 Code Example with C# Programming

```Code - C# Programming```

``````
using System;

namespace LeetCode
{
public class _0452_MinimumNumberOfArrowsToBurstBalloons
{
public int FindMinArrowShots(int[][] points)
{
if (points.Length == 0) return 0;

Array.Sort(points, (a, b) => a.CompareTo(b));

var result = 1;
int end = points;
foreach (var point in points)
{
if (point <= end)
end = Math.Min(end, point);
else
{
result++;
end = point;
}
}

return result;
}
}
}
``````
Copy The Code &

Input

cmd
points = [[1,2],[3,4],[5,6],[7,8]]

Output

cmd
4