Feat: add solutions

Author: remy727

README.md

@@ -44,6 +44,7 @@
 | 652 | Find Duplicate Subtrees | [Ruby](./algorithms/ruby/0652-find-duplicate-subtrees.rb) | Medium |
 | 733 | Flood Fill | [Ruby](./algorithms/ruby/0733-flood-fill.rb) | Easy |
 | 783 | Minimum Distance Between BST Nodes | [Ruby](./algorithms/ruby/0783-minimum-distance-between-bst-nodes.rb) [Python3](./algorithms/python3/0783-minimum-distance-between-bst-nodes.py) | Easy |
+| 875 | Koko Eating Bananas | [Ruby](./algorithms/ruby/0875-koko-eating-bananas.rb) [Python3](./algorithms/python3/0875-koko-eating-bananas.py) | Medium |
 | 904 | Fruit Into Baskets | [Ruby](./algorithms/ruby/0904-fruit-into-baskets.rb) | Medium |
 | 912 | Sort an Array | [Ruby](./algorithms/ruby/0912-sort-an-array.rb) | Medium |
 | 953 | Verifying an Alien Dictionary | [Ruby](./algorithms/ruby/0953-verifying-an-alien-dictionary.rb) | Easy |

algorithms/python3/0875-koko-eating-bananas.py

@@ -0,0 +1,50 @@
+# Problem: 875. Koko Eating Bananas
+# URL: https://leetcode.com/problems/koko-eating-bananas
+
+'''
+
+Koko loves to eat bananas. There are n piles of bananas, the ith 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.
+
+Constraints:
+
+* 1 <= piles.length <= 104
+* piles.length <= h <= 109
+* 1 <= piles[i] <= 109
+
+'''
+import math
+class Solution:
+  def minEatingSpeed(self, piles: list[int], h: int) -> int:
+    left, right = 1, max(piles)
+
+    def speedEnough(speed):
+      return sum(math.ceil(p / speed)  for p in piles) <= h
+
+    while left < right:
+      mid = (left + right) // 2
+      if speedEnough(mid):
+        right = mid
+      else:
+        left = mid + 1
+    return left
+
+# ********************#
+#       TEST         #
+# ********************#
+
+import unittest
+
+class TestminEatingSpeed(unittest.TestCase):
+  def test_minEatingSpeed(self):
+    self.assertEqual(Solution.minEatingSpeed(self, [3, 6, 7, 11], 8), 4)
+    self.assertEqual(Solution.minEatingSpeed(self, [30, 11, 23, 4, 20], 5), 30)
+    self.assertEqual(Solution.minEatingSpeed(self, [30, 11, 23, 4, 20], 6), 23)
+
+if __name__ == '__main__':
+  unittest.main()

algorithms/ruby/0875-koko-eating-bananas.rb

@@ -0,0 +1,44 @@
+# frozen_string_literal: true
+
+# Problem: 875. Koko Eating Bananas
+# URL: https://leetcode.com/problems/koko-eating-bananas
+
+=begin
+
+Koko loves to eat bananas. There are n piles of bananas, the ith 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.
+
+Constraints:
+
+* 1 <= piles.length <= 104
+* piles.length <= h <= 109
+* 1 <= piles[i] <= 109
+
+=end
+
+# @param {Integer[]} piles
+# @param {Integer} h
+# @return {Integer}
+def min_eating_speed(piles, h)
+  (1..piles.max).bsearch do |x|
+    piles.sum { (_1 + x - 1) / x } <= h
+  end
+end
+
+# ********************#
+#       TEST         #
+# ********************#
+
+require "test/unit"
+class Test_min_eating_speed < Test::Unit::TestCase
+  def test_
+    assert_equal 4, min_eating_speed([3, 6, 7, 11], 8)
+    assert_equal 30, min_eating_speed([30, 11, 23, 4, 20], 5)
+    assert_equal 23, min_eating_speed([30, 11, 23, 4, 20], 6)
+  end
+end