Create 875. Koko Eating Bananas.py

Co-Authored-By: Antim-IWP <203163676+Antim-IWP@users.noreply.github.com>
Co-Authored-By: Shiwangi Srivastava <174641070+IamShiwangi@users.noreply.github.com>

Author: 3 people

Solution/875. Koko Eating Bananas/875. Koko Eating Bananas.py

@@ -0,0 +1,6 @@
+class Solution:
+    def minEatingSpeed(self, piles: List[int], h: int) -> int:
+        def check(k: int) -> bool:
+            return sum((x + k - 1) // k for x in piles) <= h
+
+        return 1 + bisect_left(range(1, max(piles) + 1), True, key=check)