# Koko Eating Bananas: Walkthrough
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 a candidate k, hours needed is sum(ceil(pile/k)); it is feasible when that total is <= h. The answer is the smallest such k.
## 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 log M).
## Common mistake
Using average(piles)/h, which can underestimate because leftover piles still cost a full hour each.
## 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 learn more.