tomatocream
1dec88aaf2
Add populate-notes.mjs that fetches problem descriptions and Python/C++ code stubs from LeetCode's GraphQL API. Populated all 197 NeetCode 150 note files with: - Problem description (examples, constraints) - Python code stub (function signature) - C++ code stub (function signature + includes) API responses cached in leetcode/.cache/leetcode/ for instant re-runs.
1.4 KiB
1.4 KiB
TODO 0875. Koko Eating Bananas medium
Koko loves to eat bananas. There are n piles of bananas, the i^{th} pile has piles[i] bananas. The guards have gone and will come back in h hours.
Koko can decide her bananas-per-hour eating speed of k. Each hour, she chooses some pile of bananas and eats k bananas from that pile. If the pile has less than k bananas, she eats all of them instead and will not eat any more bananas during this hour.
Koko likes to eat slowly but still 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.
Example 1:
Input: piles = [3,6,7,11], h = 8
Output: 4Example 2:
Input: piles = [30,11,23,4,20], h = 5
Output: 30Example 3:
Input: piles = [30,11,23,4,20], h = 6
Output: 23Constraints:
1 <= piles.length <= 10^{4}piles.length <= h <= 10^{9}1 <= piles[i] <= 10^{9}
TODO Approach
Write your approach here.
TODO Python
class Solution:
def minEatingSpeed(self, piles: List[int], h: int) -> int:TODO C++
class Solution {
public:
int minEatingSpeed(vector<int>& piles, int h) {
}
};