Graph Traversal and Dependency Resolution Questions

Tests algorithmic skills for graph related problems that arise in build systems, dependency management, and task scheduling. Candidates should be able to implement and reason about breadth first search and depth first search, perform topological sorting using Kahn algorithm, detect and report cycles, identify strongly connected components, analyze time and space complexity, and discuss trade offs between eager and incremental resolution for large graphs. Interviewers may probe both code level implementations and system level approaches for incremental updates and partial failure handling.