Leetcode 875. Koko Eating Bananas

Find the minimum integer eating speed k such that the total hours required (sum over piles of ceil(piles[i]/k)) is ≤ h; because the required hours decreases monotonically with k, this is solved by binary searching k between 1 and max(piles).

Asked at:

Doordash

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid December, 2025

Doordash

Senior

Late April, 2025

Doordash

Mid-level

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 875. Koko Eating Bananas

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact