Search⌘ K
AI Features

Solution: Koko Eating Bananas

Explore how to apply modified binary search to efficiently find the minimum banana-eating speed for Koko to finish within a given time. This lesson helps you understand leveraging monotonic properties in search problems to optimize performance and solve constraints effectively.

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