Which optimized greedy pattern solves this lesson cleanly?

Question

Which optimized greedy pattern solves this lesson cleanly?

Option A — Correct answer

Sort by end and group intervals hit by one arrow.

Option B

Try all possible answers recursively

Option C

Use a stack for bracket matching only

Option D

Use binary search on unsorted input

Explanation

Sort by end and group intervals hit by one arrow.

Minimum Arrows to Burst Balloons - Interval End Greedy Pattern Practice Quiz