#862
Shortest Subarray with Sum at Least K
hard · verified · 32.6% accepted · 5,169 likes · top 10%
array · binary search · queue · sliding window · heap (priority queue) · prefix sum · monotonic queue
Description
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
Solution