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

Koko Eating Bananas

Explore how to use a modified binary search to determine Koko's minimum eating speed that allows her to finish all piles of bananas within a given time frame. Understand the problem setup, constraints, and implement an efficient solution optimized for large inputs.

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