Given a directed acyclic graph (DAG), return a linear ordering of its vertices such that for every directed edge u -> v from vertex u to vertex v, u comes before v in the ordering.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.