# Coffman Graham Layered Scheduling: Practice Notes

Coffman Graham Layered Scheduling shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Assign each task the longest path of successors, then repeatedly pick a ready task whose successor list is lexicographically smallest so the schedule respects precedence and minimizes worst-case delay.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n^2) after a topological layering of the DAG.

## Common mistake

Comparing successor lists without first sorting them by already-assigned labels, which picks the wrong ready task.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at multilingual AI interview assistant.