BuildSeniorBackendAuto-graded

Order a graph so dependencies come before dependents

Ordering work so nothing starts before what it needs, and spotting the impossible case, is what this measures.Implement resolve_order(graph): a topological sort that returns an order in which every dependency appears before whatever needs it. The graph maps each node to its direct dependencies, and it can include nodes that depend on nothing and are needed by nothing. Your order has to be valid for the whole graph, disconnected pieces included.

45 min

python

Start lab

What it measures

Data structures and algorithmsImplementing a topological sort over an adjacency mapping, including the bookkeeping that keeps it linear.

Algorithm designChoosing a traversal that handles shared and disconnected nodes without special-casing them.

CompletenessProducing an order covering every node, rather than only those reachable from an arbitrary starting point.

Your environment

Terminal + editorA full shell in the browser

Claude CodePre-authenticated, no key setup

Isolated microVMYours alone, wiped afterwards

Start this lab

45 min

Start labYou'll sign in to Anthropos to start. The lab opens in a private cloud workspace with Claude Code ready to use.

AI Labs is part of Anthropos Workforce. Not on your plan yet? Book a demo