Minimum Size Subarray Sum Python Solution

lcpy gen -n 209   # by problem number
lcpy gen -s minimum_size_subarray_sum   # by problem name

Input: target = 7, nums = [2,3,1,2,4,3]
Output: 2
Explanation: The subarray [4,3] has the minimal length under the problem constraint.

Input: target = 4, nums = [1,4,4]
Output: 1

Input: target = 11, nums = [1,1,1,1,1,1,1,1]
Output: 0

class Solution:
    # Time: O(n)
    # Space: O(1)
    def min_sub_array_len(self, target: int, nums: list[int]) -> int:
        left = 0
        window_sum = 0
        min_len = len(nums) + 1

        for right in range(len(nums)):
            window_sum += nums[right]
            while window_sum >= target:
                min_len = min(min_len, right - left + 1)
                window_sum -= nums[left]
                left += 1

        return 0 if min_len > len(nums) else min_len