Compute task order and layered execution

Q: Compute task order and layered execution

This question evaluates a candidate's understanding of graph algorithms and dependency resolution, covering concepts such as topological ordering and cycle detection.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

You have N tasks labeled 0..N-1 and prerequisite pairs (a, b) meaning task a must complete before task b can start. Return any valid execution order of all tasks, or an empty list if no such order exists. Additionally, return the tasks grouped by levels, where level i contains all tasks that can start only after all tasks in levels < i complete. Describe the algorithm, complexity, and how you detect cycles.

Compute task order and layered execution

Overview

Comments (0)