Koko Eating Bananas
Koko loves to eat bananas. There are n piles of bananas, and the i^th pile has piles[i] bananas. The guards have gone and will come back in h hours.
Koko can decide her bananas-per-hour eating speed of k. Each hour, she chooses some pile of bananas and eats k bananas from that pile. If the pile has less than k bananas, she eats all of them instead and will not eat any more bananas during this hour.
Koko likes to eat slowly but still wants to finish eating all the bananas before the guards return.
Return the minimum integer k such that she can eat all the bananas within h hours.
Example 1
Input
piles = [3,6,7,11], h = 8Output
4At speed 4, Koko can finish the piles within 8 hours, and no smaller integer speed is sufficient.
Example 2
Input
piles = [30,11,23,4,20], h = 5Output
30With only 5 hours, Koko must eat at speed 30 to finish all piles in time.
Constraints
- 1 <= piles.length <= 10^4
- piles.length <= h <= 10^9
- 1 <= piles[i] <= 10^9
Asked at 38 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.