Gamified challenge · Greedy by end point
Each balloon is [start, end] with start <= end: it covers every x from start to end, both included. An arrow fired straight up at position x pops every balloon with start <= x <= end, and keeps going.
Write minArrows(balloons) that returns the fewest arrows that pop every balloon. For [[10, 16], [2, 8], [1, 6], [7, 12]] the answer is 2 (arrows at 6 and 12). Balloons that only touch, like [1, 2] and [2, 3], can share an arrow at 2.
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google