Koko Eating Bananas

Updated: Mar 24, 2021

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

Example 2:

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

Example 3:

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


  • 1 <= piles.length <= 104

  • piles.length <= h <= 109

  • 1 <= piles[i] <= 109


class Solution {
    public int minEatingSpeed(int[] piles, int h) {
        int left=1,right=1;
        for(int pile:piles)
            int mid=left+(right-left)/2;
        return left;
    private boolean caneat(int[] piles,int H,int k)
        for(int pile:piles)
            H -=(1+(pile-1)/k);
        return H>=0;

36 views0 comments

Recent Posts

See All

A string s is called good if there are no two different characters in s that have the same frequency. Given a string s, return the minimum number of characters you need to delete to make s good. The f

The numeric value of a lowercase character is defined as its position (1-indexed) in the alphabet, so the numeric value of a is 1, the numeric value of b is 2, the numeric value of c is 3, and so on.