Algorithm: Topological sort Difficulty: Medium Time: 35 minutes
Goal
Return whether all n courses can be completed without violating any prerequisite relationship.
Coding (Algo)
Algorithm: Topological sort Difficulty: Medium Time: 35 minutes
Return whether all n courses can be completed without violating any prerequisite relationship.
Check Dependency Feasibility is a coding (algo) interview exercise that trains prompt interpretation, explicit assumptions, a concrete response, and a clear explanation of tradeoffs. The catalog marks it as medium difficulty. It focuses on Technical Reasoning, Testing, Validation. The signed-in workspace provides the tools for the round and evaluates the attempt against task-specific criteria. Reference solutions, hidden checks, evaluator instructions, and candidate work remain private.