195. Koko Eating Bananas

Medium

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: piles = [3,6,7,11], h = 8

Output: 4

Explanation: With k = 4, Koko eats: Pile 1: ceil(3/4) = 1 hour Pile 2: ceil(6/4) = 2 hours Pile 3: ceil(7/4) = 2 hours Pile 4: ceil(11/4) = 3 hours Total hours = 1 + 2 + 2 + 3 = 8 hours. This is <= h. Any k < 4 would exceed 8 hours. For example, k=3: total hours = ceil(3/3)+ceil(6/3)+ceil(7/3)+ceil(11/3) = 1+2+3+4 = 10 > 8.

Example 2:

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

Output: 30

Explanation: With h=5, and 5 piles, Koko must eat each pile in exactly one hour. To do this, her speed 'k' must be at least the size of the largest pile. max(piles) is 30. So, k=30 ensures each pile is eaten in 1 hour (e.g., ceil(30/30)=1, ceil(11/30)=1, etc.), total 5 hours. Any k < 30 (e.g., k=29 for pile 30) would take 2 hours for that pile, exceeding total hours.

Example 3:

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

Output: 23

Explanation: With k = 23, Koko eats: Pile 1 (30): ceil(30/23) = 2 hours Pile 2 (11): ceil(11/23) = 1 hour Pile 3 (23): ceil(23/23) = 1 hour Pile 4 (4): ceil(4/23) = 1 hour Pile 5 (20): ceil(20/23) = 1 hour Total hours = 2 + 1 + 1 + 1 + 1 = 6 hours. This is <= h. Any k < 23 (e.g., k=22 for pile 23) would take 2 hours for that pile, exceeding total hours.

Constraints:

•
•
•

Time Complexity

O(N * log(M))

Space Complexity

O(1)

195. Koko Eating Bananas

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

195. Koko Eating Bananas

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases