Koko Eating Bananas Problem

Koko Eating Bananas Problem — ExecCode Medium DSA Practice

Solve the Koko Eating Bananas problem on ExecCode. Free online medium DSA practice in Binary Search. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Koko loves to eat bananas. There are n piles of bananas, 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 k. Each hour, she chooses some pile and eats k bananas from it. If the pile has fewer than k bananas, she eats all of them instead and will not eat any more bananas during that hour. Koko likes to eat slowly but still wants to finish all the bananas before the guards return. Return the minimum integer k such that she can eat all the bananas within h hours.

Examples

Input piles = [3, 6, 7, 11, 15, 18], h = 8; Output 11. Input piles = [3, 6, 7, 11], h = 8; Output 4. Input piles = [30, 11, 23, 4, 20], h = 6; Output 23

Constraints

1 ≤ piles.length ≤ 10⁴ piles.length ≤ h ≤ 10⁹ 1 ≤ piles[i] ≤ 10⁹

Practice Koko Eating Bananas free on ExecCode. Browse DSA problems, topic map, and placement guides.