# Time Needed To Inform All Employees: Explained

Time Needed To Inform All Employees shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

DFS/BFS down the manager tree: a manager's inform time plus the max child subtree informs. The answer is that value at the head.

## 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).

## Common mistake

Summing every edge instead of taking the max branch.

## 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 www.linkjob.ai.