Search⌘ K
AI Features

Koko Eating Bananas

Explore how to apply modified binary search techniques to solve the Koko Eating Bananas problem. Understand how to find the minimum constant eating speed required for Koko to finish all banana piles within a given time constraint. This lesson helps you develop problem-solving strategies for real-world applications of binary search and optimize your approach to time-limited tasks.

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: ...