Rate Optimization with Binary Search | Dataford Interview Questions

Implement a binary search-based solution to solve the Koko Eating Bananas problem, or a similar rate-optimization problem.

Given a list of banana piles and an integer h, return the minimum integer eating speed that allows all bananas to be eaten within h hours. Each hour, Koko eats from one pile and can eat at most the chosen speed.

Input and Output

Implement def min_eating_speed(piles, h):. Return an integer speed.

Constraints

1 <= len(piles) <= 10^4
1 <= piles[i] <= 10^9
len(piles) <= h <= 10^9

Function Signature

def min_eating_speed(piles, h):

Your question is Rate Optimization with Binary Search. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem