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

Koko Eating Bananas

Explore how to determine the minimum constant eating speed that allows Koko to finish all banana piles within a given time limit. Understand the problem constraints and apply a modified binary search approach to efficiently solve the challenge, enhancing your skills in algorithmic problem solving and time complexity evaluation.

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 (bananas per hour). She keeps this speed constant throughout.

In each hour, Koko selects one pile of bananas and eats from it according to the following rules: ...