Skip to content

Practice Minimum Number of Arrows to Burst Balloons

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#452
LeetCode Problem

Minimum Number of Arrows to Burst Balloons

Problem Statement

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.

Source: Minimum Number of Arrows to Burst Balloons on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

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

# Example 2

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

# Example 3

Input
points = [[1,2],[2,3],[3,4],[4,5]]
Output
2

Constraints

1 <= points.length <= 10^5
points[i].length == 2
-2^31 <= xstart < xend <= 2^31 - 1

Related LeetCode Problems

Practice more problems similar to Minimum Number of Arrows to Burst Balloons.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.