Create 209. Minimum Size Subarray Sum

Author: khushi3004

209. Minimum Size Subarray Sum

@@ -0,0 +1,18 @@
+class Solution {
+    public int minSubArrayLen(int target, int[] nums) {
+        int currSum = 0, window = Integer.MAX_VALUE;
+        int start = 0, end = 0;
+
+        for(end = 0; end < nums.length; end++){
+            currSum += nums[end];
+            while(currSum >= target){
+                window = Math.min(window, end-start+1);
+                currSum -= nums[start];
+                start++;
+            }
+        }
+
+        return window == Integer.MAX_VALUE ? 0 : window;
+
+    }
+}