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

Solution: Koko Eating Bananas

Understand how to apply modified binary search to find the minimum constant eating speed that allows Koko to finish all banana piles within a given time. Learn to analyze the problem's monotonic behavior, implement an efficient search strategy, and evaluate its time and space complexity.

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