Implement `minSubArrayLen(target, nums)` returning the length of the smallest contiguous subarray whose sum is at least `target`, or `0` if none exists. All values are positive.
+ 1 hidden test run on Submit.
A grow-then-shrink window finds the minimal qualifying length in O(n).
Run your code to see results.