Which optimized heap pattern solves this lesson cleanly?

Question

Which optimized heap pattern solves this lesson cleanly?

Option A — Correct answer

Greedy max-heap cycles of length n + 1.

Option B

Plain nested loops without ordering

Option C

Hash set lookup only

Option D

Binary search on unsorted input

Explanation

Greedy max-heap cycles of length n + 1.

Task Scheduler - Greedy Max-Heap Pattern Practice Quiz