Lexicographically smallest topological sort
Given a directed graph with n nodes (0..n-1) and edges [u, v] meaning u must come before v, return the lexicographically smallest topological ordering as a list of node labels. If the graph has a cycle (no valid ordering), return an empty list. Constraints: 1 <= n <= 2000.
Implement
lexicographic_topo_sort(n: int, edges: list[list[int]]) → list[int]Examples
in
[3,[[0,2],[1,2]]]out[0,1,2]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[3,[[0,2],[1,2]]][0,1,2]not run yetsample