algorithmsEASYALGORITHM TRACING
Warm up with topological deploy order
Easy Algorithms arena: DAG ordering, cycle detection, and dependency resolution
XP reward
110
Coins
9
Target time
24m
Services must deploy only after dependencies are healthy. You are working inside an algorithm arena, and the arena only clears when the result is safe, deterministic, and explainable.
Learning objective
Learn to apply DAG ordering, cycle detection, and dependency resolution in an algorithm arena while explaining the invariant, safety constraints, and hidden edge cases.
Mission order
Dependency pairs are service_before -> service_after. Implement the direct solution first, then document the one edge case that can break it. Submit the solution plus enough reasoning to pass hidden edge cases.Visible checks
sample case
Expected: 2
empty input
Expected: 0
Clear requirements
- Demonstrates DAG ordering, cycle detection, and dependency resolution
- Handles the visible sample and hidden edge cases
- Keeps output deterministic and explainable
- Avoids unsafe dynamic execution
Secure validation contract
Judge type
ALGORITHM TRACING
Complexity target
Readable O(n) or O(n log n) baseline
Workspace
Code editor
pythonsafe mock judge
Charging editor core
Test Results
Run the visible checks when your first pass is ready.
Clear Protocol
1Read the scenario and restate the expected output shape.
2Run visible checks before chasing hidden edge cases.
3Use Genie for one nudge if stuck, then explain the invariant.
4Submit only when the result is deterministic and safe.
Rewards
XP
110
Coins
9
Mission Route
Hints
Hints are metered and logged for No Hint Hero runs.
Genie Mentor Core
Hint protocol / contextual guardrails active
Progressive hints
Failed-test aware
Solution guarded
Mission: algorithms-easy-toposort-deploy0 attempts0 failed tests0 hints used
Progressive hint depth
Genie: Genie online. I use your mission, attempts, failed tests, hints, and path context to coach the next rep without dumping answers first.