hardArrayBinary SearchHeap Priority QueueMonotonic QueuePrefix SumQueueSliding Window 0 views
Shortest Subarray with Sum at Least K
Given an integer array nums and an integer k, return the length of the shortest non-empty subarray of nums with a sum of at least k.
Given an integer array nums and an integer k, return the length of the shortest non-empty subarray of nums with a sum of at least k. If there is no such subarray, return -1.
A subarray is a contiguous part of an array.
Example 1
Input: nums = [1], k = 1
Output: 1
Example 2
Input: nums = [1,2], k = 4
Output: -1
Example 3
Input: nums = [2,-1,2], k = 3
Output: 3
Constraints
- 1 <= nums.length <= 10^5
- -10^5 <= nums[i] <= 10^5
- 1 <= k <= 10^9
Hints
No hints yet.
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.