Solution: Shortest Subarray with Sum at Least K

Statement

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

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• ...