Topological Sort
Problem: Topological Sort
Given a directed graph with n nodes labeled 0..n-1 and a list of directed edges edges. Each edge is a pair (u, v) meaning u -> v.
Return any **topological orde...
Example
Unlock to view complete problem details
and practice with sample input/output
Was this article helpful?
View Test Cases & Run Code requires membership
Standard Input
Execution Result: