Min Size Subarray Sum

Sliding Window
Array

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.

Examples

Example 1

Input

nums

2

3

1

2

4

3

target7

Output

2

Example 2

Input

nums

1

4

target4

Output

1

Constraints

1 ≤ target ≤ 10⁹
1 ≤ nums.length ≤ 10⁵
1 ≤ nums[i] ≤ 10⁴

Stuck? Hint 1

Use two pointers to define a window.

Input

2

3

1

2

4

3

target7

Expected Output

Ctrl / ⌘ + Enter

Min Size Subarray Sum

Sliding Window
Array

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.

Examples

Example 1

Input

nums

2

3

1

2

4

3

target7

Output

2

Example 2

Input

nums

1

4

target4

Output

1

Constraints

1 ≤ target ≤ 10⁹
1 ≤ nums.length ≤ 10⁵
1 ≤ nums[i] ≤ 10⁴

Stuck? Hint 1

Use two pointers to define a window.

Input

2

3

1

2

4

3

target7

Expected Output

Ctrl / ⌘ + Enter