find the minimum number of arrows needed to burst balloons represented by an array where a[I] means the height of the balloon. The constraint was if we hit a balloon say the height of 4 then the arrow will only be able to hit the balloon with height 3 then 2 and so on

Question

Accepted Answer

Find minimum arrows needed to burst balloons in decreasing order of height

Sort the array in decreasing order of height
Initialize arrow count to 1 and max height to first balloon height
Iterate through the array and if current balloon height is greater than max height, increment arrow count and update max height
Return arrow count
Time complexity: O(nlogn) for sorting, O(n) for iteration
Space complexity: O(1)

Accepted Answer

1

find the minimum number of arrows needed to burst balloons represented by an array where a[I] means the height of the balloon. The constraint was if we hit a balloon say the height of 4 then the arrow will only be able to hit the balloon with height 3 then 2 and so on

Top Electronic Arts Software Development Engineering Intern interview questions & answers