# Maximum Running Time Of N Computers: Interview Notes

Maximum Running Time Of N Computers shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Binary search hours T; batteries can contribute at most T each, and the total must be at least n*T.

## 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 answer, sliding window, stack, or in-place rewrite) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n log sum).

## Common mistake

Allowing one battery to contribute more than T.

## 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 Linkjob AI copilot.