Added code

Author: ShashankSinha98

44. Dynamic Programming/05. Min Coin Change Bottom Up.py

@@ -1,18 +1,18 @@
 import sys
 LIM = 10**3
 dp = [0 for i in range(LIM)]
-coins = [2,1]
+coins = [1,7,10]
 
 def solve(val):
     global dp
 
-    temp = sys.maxsize
     for i in range(1,val+1):
+        temp = sys.maxsize
         for c in coins:
             if i-c>=0:
                 temp = min(dp[i-c],temp)
         dp[i] = temp+1
-        temp = sys.maxsize
+        
     return dp[val]
 
 

44. Dynamic Programming/06. Min Coin Change Top Down.py

@@ -15,7 +15,7 @@ def solve(v):
     temp = sys.maxsize
     for c in coins:
         if v-c>=0:
-            temp = min(temp,solve(v-c)) if dp[v-c]==0 else min(temp,dp[v-c])
+            temp = min(temp,solve(v-c)) 
 
     dp[v] = temp + 1
     return dp[v]

44. Dynamic Programming/Wines Problem Bottom Up.py

@@ -0,0 +1,24 @@
+
+wines = [2,4,6,2,5]
+
+n = len(wines)
+dp = [[0]*n for i in range(n)]
+
+for i in range(n-1,-n,-1):
+    for x in range(0,n):
+        y = x-i
+
+        if y<0 or y>=n:
+            continue
+        else:
+            if x>y:
+                dp[x][y] = 0
+            elif x-y==0:
+                dp[x][y] = n*wines[x]
+            else:
+                yr = n-(y-x)
+                dp[x][y] = max(wines[x]*yr+dp[x+1][y],wines[y]*yr+dp[x][y-1])
+
+
+#print(dp)
+print(dp[0][n-1])

45. DP Problems Set - I/1. Problem A - Frog 1.py

@@ -11,7 +11,7 @@ def solve(arr,n):
             dp[i] = min(abs(arr[i]-arr[i-1])+dp[i-1],abs(arr[i]-arr[i-2])+dp[i-2])
         else:
             dp[i] = abs(arr[i]-arr[i-1])
-    print(dp)
+    #print(dp)
     return dp[-1]
 
 print(solve(arr,n))

45. DP Problems Set - I/4. Problem D - Knapsack 1.py

@@ -32,7 +32,7 @@ def solve_dp(arr,n,w):
             else:
                 dp[i][wj] = dp[i-1][wj]
 
-    print(dp)
+    #print(dp)
     return dp[n][w]
 
 print(solve_dp(inp_arr,n,w))