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

Solution: Koko Eating Bananas

Understand how to apply modified binary search to find the minimum eating speed Koko requires to finish all banana piles before the guards return. This lesson helps you implement a monotonic search technique that narrows down speed efficiently, improving problem-solving skills for time-sensitive tasks.

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