Rescue Dijkstra latency route
Extreme Algorithms arena: weighted graphs, priority queues, and stale heap entries
Log in and clear the lower tiers to unlock this mission.
Missing prerequisites: algorithms-easy-dijkstra-latency
An edge network chooses the lowest-latency route between regions. You are working inside an algorithm arena, and the arena only clears when the result is safe, deterministic, and explainable.
Learn to apply weighted graphs, priority queues, and stale heap entries in an algorithm arena while explaining the invariant, safety constraints, and hidden edge cases.
- Demonstrates weighted graphs, priority queues, and stale heap entries
- 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