#862

Shortest Subarray with Sum at Least K

international master · 1905 · lc hard +32 · verified · 32.6% accepted · 5,169 likes · top 10%

⚑ Monotonic Deque (Sliding Window Max/Min)

Description

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

A subarray is a contiguous portion 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

Code

1

2

3

class Solution:
    def shortestSubarray(self, nums: List[int], k: int) -> int:

class Solution:
    def shortestSubarray(self, nums: List[int], k: int) -> int: