About this question
Medium · Algorithms & Data Structures · Quant Trader interview question · algorithms, data-structures, graph-theory, topological-sort
Your firm's build system manages dependencies between software packages. These dependencies form a Directed Acyclic Graph (DAG). Each node represents a package, and a directed edge from package A to package B indicates that package A depends on package B. A package cannot be built until all of its dependencies are built. Which algorithm correctly determines a valid build order that satisfies all dependencies?