Min Subarray Sum

Problem: Minimum Size Subarray Sum

Inspired by the festive spirit of St. Nicholas Day on December 6, your task is to solve a classic sliding window problem, perfect for developers aiming to improve their algorithm skills.

Problem Statement

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

Example

Input: target = 7, nums = [2, 3, 1, 2, 4, 3]
Output: 2
Explanation: The subarray [4, 3] has the minimal length under the problem constraint.

Constraints

• The array nums will contain positive integers.
• 1 ≤ nums.length ≤ 10^5
• 1 ≤ nums[i] ≤ 10^4
• 1 ≤ target ≤ 10^9

Hints

• Consider using the sliding window (two pointers) technique to solve this problem efficiently.

Starter Code

Below is language-agnostic starter code to help you begin a solution.