Koko Eating Bananas
Koko has n piles of bananas, piles[i] is the number of bananas in pile i Guards return in h hours, find minimum speed k to eat all bananas Each hour, Koko eats k bananas from one pile (or all if pile has < k) Example: piles = [3,6,7,11], h = 8 => 4 Example: piles = [30,11,23,4,20], h = 5 => 30
I binary search the eating speed, not the array. Every candidate speed is either fast enough or not, and that split is monotonic.
Meet Coco
Coco is an AI study partner, not a person. She listens while you explain your code, asks what a line does and never hands you the fix. Sign in free to type with Coco, up to a daily limit, and to talk with her for one hour. After that, talking comes with the $79 pack. Anyone can open the editor and run their code.
Each locked part opens in the editor once the part before it passes.
Prep guides that list this problem
Our company tags come from public interview write-ups. None of these is a confirmed question.