Koko Eating Bananas
Koko loves to eat bananas. There are n piles of bananas, the ith 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. Return the minimum integer k such that she can eat all the bananas within h hours.

30:00

Koko Eating Bananas
medium
Topics
Companies

Koko loves to eat bananas. There are n piles of bananas, the ith 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. 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":8}
Output: 4
Constraints:

  • 1≤piles.length≤1041 \leq \text{piles.length} \leq 10^4

  • piles.length≤h≤109\text{piles.length} \leq h \leq 10^9

  • 1≤piles[i]≤1091 \leq \text{piles}[i] \leq 10^9

Input
arr ={"piles":[3,6,7,11],"h":8}

Start. Search range [1, max(piles)]

3

6

7

11

Low
1
Mid (k)

-

High
11

Result: 11

Variables
No variables to display
DepthFunction Call
Stack empty
0/16