Algorithm · Amazon · Medium
Given a collection of uniquely named tasks and a list of dependency pairs, produce a sequence of all tasks that respects every dependency. Each pair [A, B] states that B must be completed before A can start. If no such ordering exists because of a circular dependency, report the cycle. Suppose that after the tasks finish, a non‑empty subset of them are modified. When a task is altered, it must run again. Moreover, any task that transitively relies on a changed task (directly…
Checking your access…