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

Solution: Koko Eating Bananas

Explore how to apply a modified binary search technique to solve the Koko Eating Bananas problem. This lesson helps you understand how to identify the minimum constant speed required for Koko to finish all banana piles within a set time by using a monotonic pass/fail approach to optimize search efficiency.

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