# Koko Eating Bananas: Interview Notes
Koko Eating Bananas shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Binary search the eating speed; a candidate works when the sum of ceils of piles/speed is at most H hours.
## 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 max(pile)).
## Common mistake
Using floor division without the usual (p+k-1)//k ceiling.
## 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.