Koko loves to eat bananas. There are n piles of bananas, where the ith pile has piles[i] bananas. The guards have gone and will return in h hours. Koko can decide her bananas-per-hour eating speed k. Each hour, she chooses a pile and eats k bananas from it. If the pile has fewer than k bananas, she eats all of them and doesn’t eat more that hour. Koko wants to finish eating all the bananas before the guards return. Return the minimum integer k such that she can eat all the bananas within h hours.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?