209. Minimum Size Subarray Sum

https://leetcode.com/problems/minimum-size-subarray-sum/

Minimum Size Subarray Sum - LeetCode

 var minSubArrayLen = function(target, nums) {
     let left = right = 0;
     let min = Number.MAX_SAFE_INTEGER;
     let sum = 0;

     for(right = 0; right < nums.length; right++) {
        sum += nums[right];

        while(sum >= target) {
            min = Math.min(min, right - left + 1);
        
            sum -= nums[left];
            left++;
        }
     }

     if(min === Number.MAX_SAFE_INTEGER) return 0;

     return min;
};