Search⌘ K
AI Features

Solution: Koko Eating Bananas

Understand how to apply modified binary search to solve the Koko Eating Bananas problem efficiently. This lesson guides you through determining the minimum eating speed that allows completion within a time constraint by leveraging the problem’s monotonic property and optimizing search space. You will master iteration and time complexity evaluation relevant for similar coding challenges.

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