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

Solution: Koko Eating Bananas

Explore how to apply a modified binary search technique to determine the minimum eating speed required for Koko to finish all banana piles within given hours. Learn to analyze monotonic conditions and implement an efficient solution with time complexity O(n log M).

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