← Questions
Lexicographically smallest topological order
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given tasks and the dependencies between them, return an order that runs every task after the tasks it depends on. When several tasks are ready at once, always pick the smallest, so the order is deterministic and the lexicographically smallest valid one. Report when the dependencies contain a cycle and no order exists.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding