Which optimized greedy pattern solves this lesson cleanly?

Question

Which optimized greedy pattern solves this lesson cleanly?

Option A — Correct answer

Earliest-end interval greedy after sorting by end.

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

Earliest-end interval greedy after sorting by end.

Non-overlapping Intervals - Earliest End Greedy Pattern Practice Quiz