Deterministic Task Execution Order
Company: Google
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: easy
Interview Round: Onsite
Overview: This question evaluates a candidate's ability to model task dependencies as a directed graph and produce a valid execution order, a core graph algorithms and coding topic. It tests topological sorting combined with tie-breaking logic to select the smallest-label ready task, plus cycle detection when no valid order exists. This is a practical application question commonly used to assess algorithmic problem-solving in coding interviews.