Intervals - Minimum Number of Arrows to Burst Balloons
Given the final arrow count is 3 for the input intervals [[1,5],[2,6],[7,10],[8,11],[12,15]], which of the following could be the arrow positions chosen by the optimal greedy algorithm?
15+ quiz questions · All difficulty levels · Free
Free Signup - Practice All Questions