Dependency order
Medium · Graphs · Original CodeClash problem
Input has n and directed edges [u,v] meaning u must precede v. Return lexicographically smallest topological ordering, or [] for a cycle.
Input and output
One JSON value on a single line, with the fields described above. Read it using json.loads(input()).
One compact JSON value. Use print(json.dumps(answer, separators=(",", ":"))). Booleans must be JSON true/false. Arrays retain the stated order.
Examples
Example 1
Input: {"n":1,"edges":[]}
Output: [0]
Example 2
Input: {"n":2,"edges":[]}
Output: [0,1]
Constraints
- Array and string lengths are at most 200 unless stated otherwise.
- Integers have absolute value at most 10,000 unless stated otherwise.
- All inputs satisfy the stated preconditions.
Sign in to save progress. Public example runs are unverified and do not affect ratings.