koko-eating-bananas

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Koko loves to eat bananas. There are <code>n</code> piles of bananas, the <code>ith</code> pile has <code>piles[i]</code> bananas. The guards have gone and will come back in <code>h</code> hours.

Koko can decide her bananas-per-hour eating speed of <code>k</code>. Each hour, she chooses some pile of bananas and eats <code>k</code> bananas from that pile. If the pile has less than <code>k</code> 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 <code>k</code> such that she can eat all the bananas within <code>h</code> hours.

&nbsp;
Example 1:

<div class="example-block">
Input: piles = [3,6,7,11], h = 8

Output: 4

Explanation:

At a speed of 4 bananas per hour, Koko takes 1, 2, 2, and 3 hours to finish the respective piles, totaling 8 hours.
</div>

Example 2:

<div class="example-block">
Input: piles = [30,11,23,4,20], h = 5

Output: 30

Explanation:

Koko must finish each pile in exactly 1 hour, so her minimum eating speed must be 30 bananas per hour.
</div>

Example 3:

<div class="example-block">
Input: piles = [30,11,23,4,20], h = 6

Output: 23

Explanation:

At a speed of 23 bananas per hour, Koko takes 2 hours for the first pile and 1 hour for each remaining pile, totaling 6 hours.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= piles.length &lt;= 104</code></li>
	<li><code>piles.length &lt;= h &lt;= 109</code></li>
	<li><code>1 &lt;= piles[i] &lt;= 109</code></li>
</ul>

Weekly Contest 94

weekly-contest-94

minEatingSpeed

Senior Staff

Koko Eating Bananas

Array

Binary Search

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs

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.

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 = 8

Output: 4

Explanation:

At a speed of 4 bananas per hour, Koko takes 1, 2, 2, and 3 hours to finish the respective piles, totaling 8 hours.

Example 2:

Input: piles = [30,11,23,4,20], h = 5

Output: 30

Explanation:

Koko must finish each pile in exactly 1 hour, so her minimum eating speed must be 30 bananas per hour.

Example 3:

Input: piles = [30,11,23,4,20], h = 6

Output: 23

Explanation:

At a speed of 23 bananas per hour, Koko takes 2 hours for the first pile and 1 hour for each remaining pile, totaling 6 hours.

 

Constraints:

 * 1 <= piles.length <= 104
 * piles.length <= h <= 109
 * 1 <= piles[i] <= 109