From 8744973ff0676bcd6f6625efc621223981dcd8da Mon Sep 17 00:00:00 2001
From: Joshua Yoon <joshyoon92@gmail.com>
Date: Wed, 20 Oct 2021 05:21:20 -0500
Subject: [PATCH 1/2] completed dp3

---
 DeleteEarn.java | 25 +++++++++++++++++++++++++
 1 file changed, 25 insertions(+)
 create mode 100644 DeleteEarn.java

diff --git a/DeleteEarn.java b/DeleteEarn.java
new file mode 100644
index 00000000..2d581551
--- /dev/null
+++ b/DeleteEarn.java
@@ -0,0 +1,25 @@
+
+class DeleteEarn {
+    public int delEarn(int[] nums) {
+        int max = 0;
+        for (int i = 0; i < nums.length; i++) {
+            if (max < nums[i]) {
+                max = nums[i];
+            }
+        }
+        int[] hash = new int[max + 1];
+        for (int i = 0; i < nums.length; i++) {
+            hash[i] = 0;
+        }
+        for (int i = 0; i < max; i++) {
+            hash[i] += hash[nums[i]];
+        }
+        int skip = 0, take = 0;
+        for (int i = 0; i < max; i++) {
+            int temp = skip;
+            skip = Math.max(skip, take);
+            take = hash[i] + temp;
+        }
+        return Math.max(skip, take);
+    }
+}
\ No newline at end of file

From e8a2ddfb424cd82ed0721fe072eefef879721f92 Mon Sep 17 00:00:00 2001
From: Joshua Yoon <joshyoon92@gmail.com>
Date: Mon, 15 Jun 2026 18:09:24 -0500
Subject: [PATCH 2/2] DP-3

---
 DeleteEarn.java            | 37 +++++++++++++++++--------------------
 MinimumFallingPathSum.java | 26 ++++++++++++++++++++++++++
 2 files changed, 43 insertions(+), 20 deletions(-)
 create mode 100644 MinimumFallingPathSum.java

diff --git a/DeleteEarn.java b/DeleteEarn.java
index 2d581551..56767da7 100644
--- a/DeleteEarn.java
+++ b/DeleteEarn.java
@@ -1,25 +1,22 @@
-
-class DeleteEarn {
-    public int delEarn(int[] nums) {
-        int max = 0;
-        for (int i = 0; i < nums.length; i++) {
-            if (max < nums[i]) {
-                max = nums[i];
-            }
-        }
-        int[] hash = new int[max + 1];
-        for (int i = 0; i < nums.length; i++) {
-            hash[i] = 0;
+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]);
         }
-        for (int i = 0; i < max; i++) {
-            hash[i] += hash[nums[i]];
+        int[] arr = new int[max+1];
+
+        for (int num: nums) {
+            arr[num] += num;
         }
-        int skip = 0, take = 0;
-        for (int i = 0; i < max; i++) {
-            int temp = skip;
-            skip = Math.max(skip, take);
-            take = hash[i] + temp;
+
+        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 Math.max(skip, take);
+        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