376. Minimum Subarray Sum Length

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

Example:
Input: nums = [2,3,1,2,4,3], target = 7
Output: 2 (The subarray [4,3] has the minimal length)

Run this challenge interactively in Python or JavaScript when the app loads.