Minimum Size Subarray Sum

Problem

Given an array of positive integers nums and a positive integer target, return the minimum length of a contiguous subarray whose sum is greater than or equal to target. If no such subarray exists, return 0.

Constraints

• 1 <= nums.length <= 10^5
• 1 <= nums[i] <= 10^4
• 1 <= target <= 10^9