Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns

Solution: Koko Eating Bananas

Understand how to apply modified binary search to determine the minimum constant speed at which Koko can eat all banana piles within a given hour limit. This lesson guides you through optimizing search space by exploiting the problem's monotonic property, allowing efficient calculation of the smallest viable eating speed.

We'll cover the following...

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