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$

• $-10^5 \leq$ nums[i] $\leq 10^5$

• $1 \leq$ k $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.