diff --git a/Dynamic Programming/coin change (return maximum number of ways) b/Dynamic Programming/coin change (return maximum number of ways)
new file mode 100644
index 0000000..7e5f6a7
--- /dev/null
+++ b/Dynamic Programming/coin change (return maximum number of ways)	
@@ -0,0 +1,31 @@
+ int n=coins.size();
+        int dp[n+1][amount+1];
+        for(int i=0;i<n+1;i++)
+        {
+            for(int j=0;j<amount+1;j++)
+            {
+                if(i==0)
+                {
+                    dp[i][j]=0;
+                }
+                if(j==0)
+                {
+                    dp[i][j]=1;
+                }
+            }
+        }
+        for(int i=1;i<n+1;i++)
+        {
+            for(int j=1;j<amount+1;j++)
+            {
+                if(coins[i-1]>j)
+                {
+                    dp[i][j]=dp[i-1][j];
+                }
+                else
+                {
+                    dp[i][j]=(dp[i][j-coins[i-1]]+dp[i-1][j]);
+                }
+            }
+        }
+        return dp[n][amount];