Merge pull request neetcode-gh#2428 from IliaEre/0209-minimum-size-subarray-sum

Create: 209 Minimum Size Subarray Sum

Author: a93a

java/0209-minimum-size-subarray-sum.java

@@ -0,0 +1,17 @@
+class Solution {
+
+    public int minSubArrayLen(int target, int[] nums) {
+        int l = 0, total = 0;
+        int res = Integer.MAX_VALUE;
+
+        for (int r = 0; r < nums.length; r++) {
+            total += nums[r];
+            while (total >= target) {
+                res = Math.min(r - l + 1, res);
+                total -= nums[l++];
+            }
+        }
+
+        return res == Integer.MAX_VALUE ? 0 : res;
+    }
+}