Given an array of positive integers, nums, and a positive integer, target, find the minimum length of a contiguous subarray whose sum is greater than or equal to the target. If no such subarray is found, return 0.

Constraints:

• $1$ $\leq$ target $\leq$ $10^4$
• $1$ $\leq$ nums.length $\leq$ $10^3$
• $1$ $\leq$ nums[i] $\leq$ $10^3$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground: