A Harder Problem

Given an integer array $nums$ and an integer $k$, find the length of the shortest non-empty subarray with sum at least $k$. Return $-1$ if no such subarray exists.

This problem combines prefix sums with monotonic deques. It's harder than sliding window maximum. Arrays can contain negative numbers, which is why a simple sliding window doesn't work.