Skip to main content
Admissions guidance, study banks, and career tools — get started on Shalyam

Shortest Subarray With Sum at Least K

Print the length of the shortest non-empty contiguous subarray whose sum is at least K, or -1 if none exists. The array may contain negative numbers.

Constraints

1 <= n <= 10^5 -10^5 <= nums[i] <= 10^5 1 <= K <= 10^9

Discussion

No discussions yet.

Rewards · v2.1

Get Exclusive Insights with Every Issue

Join Shalyam Newsletter

Stay ahead in education, research, and innovation—straight to your inbox.