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

Solution: Koko Eating Bananas

Discover how to apply modified binary search to determine the minimum eating speed that allows Koko to finish all banana piles within a set number of hours. Learn to efficiently calculate time requirements and optimize speed selection with a monotonic pass/fail approach. Understand the time and space complexity of this technique in solving the problem.

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