Rescue heap task scheduler
Extreme Data Structures arena: priority queues, tie breakers, and stable scheduling
Log in and clear the lower tiers to unlock this mission.
Missing prerequisites: data-structures-easy-heap-scheduler
A job runner must always execute the highest priority ready task without starving older tasks. You are working inside an interview-style data structure lab, and the arena only clears when the result is safe, deterministic, and explainable.
Learn to apply priority queues, tie breakers, and stable scheduling in an interview-style data structure lab while explaining the invariant, safety constraints, and hidden edge cases.
- Demonstrates priority queues, tie breakers, and stable scheduling
- Handles the visible sample and hidden edge cases
- Keeps output deterministic and explainable
- Avoids unsafe dynamic execution
Clear the route first
You can read the mission brief, but the editor, hints, tests, and submit flow stay locked until progression or plan access catches up.
Test Results
Run the visible checks when your first pass is ready.
Clear Protocol
Rewards
Mission Route
Hints
Hints are metered and logged for No Hint Hero runs.
Genie Mentor Core
Hint protocol / contextual guardrails active