diff --git a/Paint_house.java b/Paint_house.java
new file mode 100644
index 00000000..339764f2
--- /dev/null
+++ b/Paint_house.java
@@ -0,0 +1,30 @@
+// Time Complexity : O(m*k*k)
+// Space Complexity : O(m*k)
+// Did this code successfully run on Leetcode : yes
+class Solution {
+    public int minCost(int[][] costs) {
+        int m = costs.length;
+        int k = costs[0].length;
+        int[][] dp = new int[m][k];
+        for(int i=0; i<k; i++){
+            dp[m-1][i] = costs[m-1][i];
+        }
+        
+        for(int i= m-2; i>=0; i--){
+            for(int j=0; j<k;j++){
+                int min = Integer.MAX_VALUE;
+                for(int next=0;next<k;next++){
+                    if(next!=j){
+                        min = Math.min(min,dp[i+1][next]);
+                    }
+                }
+                dp[i][j]= costs[i][j]+min;
+            }
+        }
+        int res = Integer.MAX_VALUE;
+        for(int j=0;j<k;j++){
+            res= Math.min(res,dp[0][j]);
+        }
+        return res;
+    }
+}
diff --git a/coin_change_2.java b/coin_change_2.java
new file mode 100644
index 00000000..a476fc23
--- /dev/null
+++ b/coin_change_2.java
@@ -0,0 +1,25 @@
+// Time Complexity :O(n*m) where n is the number of coins and m is the amount
+// Space Complexity :O(n*m)
+// Did this code successfully run on Leetcode : yes
+class Solution {
+    public int change(int amount, int[] coins) {
+        int n= coins.length;
+        int m = amount;
+        int[][] dp = new int[n+1][m+1];
+        for (int i = 0; i <= n; i++) {
+            dp[i][0] = 1;
+        }
+
+        for (int i = 1; i <= n; i++) {
+            for (int j = 1; j <= amount; j++) {
+                if (j < coins[i - 1]) {
+                    dp[i][j] = dp[i - 1][j];
+                } else {
+                    dp[i][j] = dp[i - 1][j] + dp[i][j - coins[i - 1]];
+                }
+            }
+            }
+        return dp[n][m];
+        }
+        
+    }
\ No newline at end of file