You are given a list points, where each element points[i] = [x_start, x_end] represents a balloon whose horizontal diameter spans from x_start to x_end on the x axis. An arrow can be shot vertically at any x coordinate x, and it bursts every balloon satisfying x_start <= x <= x_end.

Return the minimum number of arrows required to burst all balloons.

Constraints:

• $1 \leq$ points.length $\leq 10^5$

• points[i].length $== 2$

• $-2^{31} \leq$ x_start $<$ x_end $\leq 2^{31} - 1$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.