LeetCode - Minimum Size Subarray Sum

Problem statement Given an array of positive integers nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal to target. If there is no such subarray, return 0 instead. Problem statement taken fr...