Solution: Minimum Number of Arrows to Burst Balloons
C# solution for the Minimum Number of Arrows to Burst Balloons problem using the Greedy Techniques pattern.
We'll cover the following...
We'll cover the following...
Statement
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:
...