Shortest Subarray with Sum at Least K

lcpy gen -n 862   # by problem number
lcpy gen -s shortest_subarray_with_sum_at_least_k   # by problem name

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

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

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

from collections import deque


class Solution:
    # Time: O(n)
    # Space: O(n)
    def shortest_subarray(self, nums: list[int], k: int) -> int:
        n = len(nums)
        prefix = [0] * (n + 1)
        for i, num in enumerate(nums):
            prefix[i + 1] = prefix[i] + num
        result = n + 1
        queue: deque[int] = deque()
        for j in range(n + 1):
            while queue and prefix[j] - prefix[queue[0]] >= k:
                result = min(result, j - queue.popleft())
            while queue and prefix[queue[-1]] >= prefix[j]:
                queue.pop()
            queue.append(j)
        return result if result <= n else -1