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 the minimum banana-eating speed for Koko to finish all piles within a given time. This lesson teaches you to identify monotonic conditions and efficiently narrow the search space, improving your problem-solving skills for coding interviews.

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