209. Minimum Size Subarray Sum | LeetCode | Top Interview 150 | Coding Questions

class Solution {

    public int minSubArrayLen(int target, int[] nums) {



        int n = nums.length;

        int sum = 0;

        int left = 0;

        int ans = n + 1;



        for (int right = 0; right < n; right++) {

            sum += nums[right];



            while (sum >= target) {

                ans = Math.min(ans, right - left + 1);

                sum -= nums[left];

                left++;

            }

        }



        return ans == n + 1 ? 0 : ans;

    }

}