# Leetcode 209 - Minimum size subarray sum

Given an array of positive integers nums and a positive integer target, return the minimal length of a contiguous subarray [numsl, numsl+1, …, numsr-1, numsr] of which the sum is greater than or equal to target. If there is no such subarray, return 0 instead.

**Note:** For questions like finding a `subarray`

that fits some requirements, `sliding window`

is usually the way to go.

**Example 1:**

1 | Input: target = 7, nums = [2,3,1,2,4,3] |

1 | /** |