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 determine the minimum speed at which Koko can eat all bananas within a given time. Explore the monotonic property of the problem, implement a binary search over speeds, and analyze time and space complexities for an optimal 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 ...