Practice LinkedIn Coding Question | Real Coding Interviews

Quick Summary

Design an incremental task scheduler that accepts dependent tasks and executes them in valid topological order.
Support dynamic task insertion while detecting cycles and enforcing lexicographical priority for ready tasks.
Combine a directed dependency graph with in-degree tracking and a min-heap to manage execution state efficiently.

What This Tests

Common Patterns

Graph TraversalDFS/BFSHeap / Priority QueueHashing

Hint 1

Hint 2

Hint 3

What Interviewers May Ask Next

Report seen similar question in interview

python

Stdout