diff --git a/DeleteEarn.java b/DeleteEarn.java
new file mode 100644
index 00000000..56767da7
--- /dev/null
+++ b/DeleteEarn.java
@@ -0,0 +1,22 @@
+class Solution {
+    public int deleteAndEarn(int[] nums) {
+        int max = Integer.MIN_VALUE;
+        for (int i=0; i<nums.length; i++){
+            max = Math.max(max, nums[i]);
+        }
+        int[] arr = new int[max+1];
+
+        for (int num: nums) {
+            arr[num] += num;
+        }
+
+        int prev = arr[0];
+        int curr = Math.max(arr[0],arr[1]);
+        for (int i=2; i<arr.length; i++){
+            int temp = curr;
+            curr= Math.max(curr,prev+arr[i]);
+            prev = temp;
+        }
+        return curr;
+    }
+}
\ No newline at end of file
diff --git a/MinimumFallingPathSum.java b/MinimumFallingPathSum.java
new file mode 100644
index 00000000..bde752f8
--- /dev/null
+++ b/MinimumFallingPathSum.java
@@ -0,0 +1,26 @@
+class Solution {
+    public int minFallingPathSum(int[][] grid) {
+        int m = grid.length;
+        int n = grid[0].length;
+        int[][] dp = new int[m+1][n+1];
+        for(int i=0;i<n;i++){
+            dp[0][i] = grid[0][i];
+        }
+        for(int i=1;i<m;i++){
+            for(int j=0;j<n;j++){
+                if(j==0){
+                    dp[i][j] = grid[i][j] + Math.min(dp[i-1][j],dp[i-1][j+1]);
+                }else if(j==n-1){
+                   dp[i][j] = grid[i][j] + Math.min(dp[i-1][j],dp[i-1][j-1]); 
+                }else{
+                    dp[i][j] = grid[i][j] + Math.min(dp[i-1][j],Math.min(dp[i-1][j-1],dp[i-1][j+1]));
+                }
+            }
+        }
+        int res = Integer.MAX_VALUE;
+        for(int i=0;i<n;i++){
+            res = Math.min(res,dp[m-1][i]);
+        }
+        return res;
+    }
+}
\ No newline at end of file