LeetCode 875: Koko Eating Bananas Solution

Master LeetCode problem 875 (Koko Eating Bananas), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

875. Koko Eating Bananas

Medium

Array Binary Search

Problem Explanation

Explanation

To solve this problem, we can use binary search to find the minimum integer k such that Koko can eat all the bananas within h hours. We will consider the range of possible values for k between 1 and the maximum number of bananas in the piles. For each value of k, we will calculate the total hours needed to eat all the bananas. If the total hours needed is less than or equal to h, we will update our search space to the left half; otherwise, we will update our search space to the right half.

Algorithm:

Initialize left = 1 and right = maximum number of bananas in the piles.
Perform binary search to find the minimum k such that Koko can eat all the bananas within h hours.
Within the binary search loop, calculate the total hours needed for the current value of k by iterating through all piles and adding up the hours needed to eat each pile.
Update the search space based on the total hours needed.
Return the minimum k found.

Time Complexity: O(n log m), where n is the number of piles and m is the maximum number of bananas in the piles.

Space Complexity: O(1)

Solution Code

class Solution {
    public int minEatingSpeed(int[] piles, int h) {
        int left = 1;
        int right = Arrays.stream(piles).max().getAsInt();

        while (left < right) {
            int mid = left + (right - left) / 2;
            int hours = 0;
            for (int pile : piles) {
                hours += (pile + mid - 1) / mid;
            }
            if (hours <= h) {
                right = mid;
            } else {
                left = mid + 1;
            }
        }
        
        return left;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 875 (Koko Eating Bananas)?

This page provides optimized solutions for LeetCode problem 875 (Koko Eating Bananas) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 875 (Koko Eating Bananas)?

The time complexity for LeetCode 875 (Koko Eating Bananas) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 875 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 875 in Java, C++, or Python.

Back to LeetCode Solutions