https://leetcode.com/problems/maximum-subarray/

interview_prep/algorithm/java/src/main/java/hoa/can/code/med/MaxSubArr.java

@@ -0,0 +1,21 @@
+package hoa.can.code.med;
+
+/**
+ * <a href="https://leetcode.com/problems/maximum-subarray/">desc</a>
+ */
+public class MaxSubArr {
+    public int maxSubArray(int[] nums) {
+        int maxSoFar = Integer.MIN_VALUE;
+        int maxEndingAt = 0;
+        for (int num : nums) {
+            maxEndingAt = maxEndingAt + num;
+            if (maxSoFar < maxEndingAt) {
+                maxSoFar = maxEndingAt;
+            }
+            if (maxEndingAt < 0) {
+                maxEndingAt = 0;
+            }
+        }
+        return maxSoFar;
+    }
+}

interview_prep/algorithm/java/src/test/java/hoa/can/code/MaxSubArrSumTest.java

@@ -0,0 +1,19 @@
+package hoa.can.code;
+
+import hoa.can.code.ez.LongestPalindrome;
+import hoa.can.code.med.MaxSubArr;
+import org.junit.jupiter.api.DisplayName;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class MaxSubArrSumTest {
+    MaxSubArr tst = new MaxSubArr();
+    @Test
+    @DisplayName("max sub arr sum")
+    public void test(){
+        assertEquals(1, tst.maxSubArray(new int[]{1}));
+        assertEquals(6, tst.maxSubArray(new int[]{-2,1,-3,4,-1,2,1,-5,4}));
+        assertEquals(23, tst.maxSubArray(new int[]{5,4,-1,7,8}));
+    }
+}