Citadel
Interview Question
Software Engineer Intern Interview
Citadel
How would you solve a scheduling issue given a directed acyclic graph (DAG) of tasks and k computers? What if k is one or infinity?
Unlock the Full Solution
Enter your email to get instant access to the complete solution, explanation, and similar practice problems.
