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 at which Koko can eat all banana piles within a given time. This lesson helps you analyze problem constraints, implement efficient search strategies, and solve a real-world inspired coding challenge involving time and capacity tradeoffs.

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