808. Soup Servings

Author: remy727

README.md

@@ -230,6 +230,7 @@
 | 785 | Is Graph Bipartite? | [Ruby](./algorithms/ruby/0785-is-graph-bipartite.rb) | Medium |
 | 790 | Domino and Tromino Tiling | [Ruby](./algorithms/ruby/0790-domino-and-tromino-tiling.rb) | Medium |
 | 802 | Find Eventual Safe States | [Ruby](./algorithms/ruby/0802-find-eventual-safe-states.rb) | Medium |
+| 808 | Soup Servings | [Ruby](./algorithms/python3/0808-soup-servings.py) | Medium |
 | 815 | Bus Routes | [Ruby](./algorithms/ruby/0815-bus-routes.rb) | Hard |
 | 837 | New 21 Game | [Ruby](./algorithms/ruby/0837-new-21-game.rb) | Medium |
 | 839 | Similar String Groups | [Ruby](./algorithms/ruby/0839-similar-string-groups.rb) | Hard |

algorithms/python3/0808-soup-servings.py

@@ -0,0 +1,41 @@
+# 808. Soup Servings
+# Medium
+# https://leetcode.com/problems/soup-servings
+
+import math;
+
+class Solution:
+  def soupServings(self, n: int) -> float:
+    m = math.ceil(n / 25)
+    dp = {}
+
+    def calculate_dp(i, j):
+      return (dp[max(0, i - 4)][j] + dp[max(0, i - 3)][j - 1] +
+              dp[max(0, i - 2)][max(0, j - 2)]
+              + dp[i - 1][max(0, j - 3)]) / 4
+
+    dp[0] = {0: 0.5}
+    for k in range(1, m + 1):
+      dp[0][k] = 1
+      dp[k] = {0: 0}
+      for j in range(1, k + 1):
+        dp[j][k] = calculate_dp(j, k)
+        dp[k][j] = calculate_dp(k, j)
+      if dp[k][k] > 1 - 1e-5:
+        return 1
+    return dp[m][m]
+
+# ********************#
+#       TEST         #
+# ********************#
+
+import unittest
+
+class TestStringMethods(unittest.TestCase):
+  def test_addBinary(self):
+    self.assertEqual(Solution.soupServings(self, 50), 0.62500)
+    self.assertEqual(Solution.soupServings(self, 100), 0.71875)
+
+
+if __name__ == '__main__':
+    unittest.main()