<ul><li>Given an integer array nums and an integer k, return the length of the shortest non-empty subarray of nums with a sum of at least k.</li><li>The solution involves using a sliding window approach combined with prefix sums and a monotonic queue.</li><li>The time complexity of the solution is O(n), where n is the length of the input array.</li><li>The space complexity is O(n) due to the prefix sum array and the deque used to store indices.</li></ul>

862. Shortest Subarray with Sum at Least K

Discover more