> For the complete documentation index, see [llms.txt](https://qatesting.gitbook.io/qa/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://qatesting.gitbook.io/qa/java/data-structures-+-algorithms/sliding-window-technique/leetcode-209.md).

# LeetCode #209

{% embed url="<https://leetcode.com/problems/minimum-size-subarray-sum/description/>" %}
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.
{% endembed %}