Search⌘ K
AI Features

Koko Eating Bananas

Explore how to apply modified binary search to determine the minimum speed Koko needs to eat all bananas within a given time limit. This lesson helps you understand problem analysis, implement the correct algorithm, and optimize for time constraints efficiently.

Statement

Koko has nn piles of bananas in front of her, where the ithi^{th} pile has piles[i] bananas. The guards have left and will return in h hours, and Koko must finish all the bananas before they come back.

Before eating, Koko chooses an integer as an eating speed kk (bananas per hour). She keeps this speed constant throughout.

In each hour, Koko selects one pile of bananas and eats from it according to the following rules: ...