Shortest Subarray with Sum at Least K

Hard

Given an integer array nums and an integer target, return the length of the shortest non-empty contiguous subarray whose sum is at least target. If there is no such subarray, return -1.

Example 1

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

Example 2

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

Example 3

Input:  nums = [2,-1,2], target = 3
Output: 3

Constraints

• 1 <= nums.length <= 10^5
• -10^5 <= nums[i] <= 10^5
• 1 <= target <= 10^9