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

Solution: Koko Eating Bananas

Understand how to apply modified binary search to determine Koko’s minimum eating speed that ensures all bananas are eaten before the guards return. Explore the technique of narrowing down search ranges based on monotonic conditions to optimize performance and analyze the time-space complexity of this approach.

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