Build Order Algorithm - Quant Trader Interview Question
Difficulty: Medium
Category: Algorithms & Data Structures
Practice quant interview questions from top firms including Jane Street, Citadel, Two Sigma, DE Shaw, and other leading quantitative finance companies.
Topics: algorithms, data-structures, graph-theory, topological-sort
Problem Description
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?
Practice this medium trader interview question on MyntBit - the all-in-one quant learning platform with 200+ quant interview questions for Jane Street, Citadel, Two Sigma, and other top quantitative finance firms.