Search⌘ K
AI Features

Solution: Koko Eating Bananas

Explore how to apply modified binary search to determine the minimum eating speed that allows Koko to finish all banana piles within the given hours. Understand the monotonic behavior of the problem which makes binary search an efficient method for solving this optimization task while analyzing its time and space complexities.

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