Task Dependency Ordering

Task Ordering Medium · Topics · Company Tags · Hints You are given a dependency graph for a set of tasks. Each key in the input map is the name of a task, and the associated list contains all tasks that must be completed before that key can start. All distinct task names (both keys and names that appear only in dependency lists) must be scheduled. Return a valid linear ordering of every task. In the ordering, whenever a task B depends on a task A, A must appear earlier in…