Merge pull request #893 from krishx06/feature/unbounded_knapsack

Unbounded Knapsack Problem

Author: ghostmkg

Python/unbounded_knapsack_problem.py

@@ -0,0 +1,9 @@
+def getMaximumValue(weights, values, n, maxWeight):
+    dp = [0] * (maxWeight + 1)
+
+    for w in range(1, maxWeight + 1):
+        for i in range(n):
+            if weights[i] <= w:
+                dp[w] = max(dp[w], dp[w - weights[i]] + values[i])
+
+    return dp[maxWeight]