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

Solution: Koko Eating Bananas

Explore how to apply modified binary search to determine the minimal eating speed Koko needs to finish all banana piles within a given time. Understand the monotonic pass/fail property of this problem and implement an efficient search to optimize your solution.

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