406. Minimum Size Subarray Sum

int minimumSize(vector<int> &nums, int s) { // write your code here int sum = 0; int res = INT_MAX; for(int left = 0, right = 0; right < nums.size(); right++){ sum += nums[right]; while(sum >= s){ res = min(res, right - left + 1); sum -= nums[left++]; } } return res == INT_MAX ? -1 : res; }