Which optimized greedy pattern solves this lesson cleanly?
Practice this question from Jump Game - Farthest Reach Greedy Pattern Practice Quiz, with options and an explanation.
Question
Which optimized greedy pattern solves this lesson cleanly?
Option A — Correct answer
Farthest-reach greedy scan.
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
Farthest-reach greedy scan.