209. Minimum Size Subarray Sum

Medium

9.4K

263

Given an array of positive integers `nums`

and a positive integer `target`

, return *the minimal length of a *

`target`

. If there is no such subarray, return `0`

instead.

**Example 1:**

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

**Example 2:**

Input:target = 4, nums = [1,4,4]Output:1

**Example 3:**

Input:target = 11, nums = [1,1,1,1,1,1,1,1]Output:0

**Constraints:**

`1 <= target <= 10`

^{9}`1 <= nums.length <= 10`

^{5}`1 <= nums[i] <= 10`

^{4}

`O(n)`

solution, try coding another solution of which the time complexity is `O(n log(n))`

.Accepted

700.8K

Submissions

1.6M

Acceptance Rate

45.1%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved