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

Koko Eating Bananas

Understand how to apply modified binary search to determine the minimum constant speed needed for Koko to eat all banana piles within a given time frame. This lesson guides you through problem constraints, solution logic, and practical coding implementation.

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