# Koko Eating Bananas: Practice 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 eat-speed k; for each candidate, hours needed is the sum of ceil(pile/k). Find the smallest k that finishes by h.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (two pointers, a sliding window, prefix sums, a monotonic stack, or binary search on the answer) and why a linear nested scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n log maxP).
## Common mistake
Trying every speed from 1 to max(pile), which is linear in the value range.
## 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 https://www.linkjob.ai/.