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

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.

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:

  • If the pile contains at least kk bananas, she eats exactly kk bananas from it.

  • If the pile contains fewer than kk bananas, she eats all the bananas from that pile and does not eat from any other pile during that hour.

Your task is to return the minimum eating speed k ...