875. Koko Eating Bananas

Koko has piles of bananas and h hours. Each hour she picks a pile and eats k bananas from it (or the whole pile if it has fewer). Return the minimum integer speed k that lets her finish every pile within h hours.

Hours needed only go down as k goes up, so binary-search k in [1, max(piles)] for the smallest speed that fits in h hours.

1function minEatingSpeed(piles: number[], h: number): number {
2  let lo = 1, hi = Math.max(...piles);
3  while (lo < hi) {
4    const k = (lo + hi) >> 1;
5    const hours = piles.reduce((s, p) => s + Math.ceil(p / k), 0);
6    if (hours <= h) hi = k;
7    else lo = k + 1;
8  }
9  return lo;
10}

lo = 1hi = 11h = 8

piles

Speed is between 1 and the biggest pile, 11.

1 / 0

Space: play/pause · ←/→: step