Return the lexicographically smallest valid task order from a directed acyclic dependency graph, including disconnected and prerequisite-free tasks.
Company: OpenAI
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Technical Screen
Overview: Return the lexicographically smallest valid task order from a directed acyclic dependency graph, including disconnected and prerequisite-free tasks.
Blind 75
75 free coding problems to build your foundations, with hints, explanations, and a progress checklist.
Data Structures & Algorithms
The patterns behind arrays, pointers, trees, graphs and dynamic programming, with worked Python examples.
Cracking the Coding Interview Companion
Our free, unofficial companion to the book: how to analyze, solve and speed up coding problems, in Python.