Available question text
Find the length of the shortest contiguous subarray whose sum is at least k, or return -1 if none exists. Because nums can contain negative values (n up to 1e5), this requires using prefix sums with a monotonic deque (or equivalent) rather than a simple two-pointer sliding window.
Related questions
Continue with questions that share topics or the same question type.
- Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
Coding · Array · Heap (Priority Queue) · Monotonic Queue
- Sliding Window Maximum
Coding · Array · Heap (Priority Queue) · Monotonic Queue
- Minimum Size Subarray Sum
Coding · Array · Binary Search · Prefix Sum
- Subarray Product Less Than K
Coding · Array · Binary Search · Prefix Sum
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Meta
Leetcode 862. Shortest Subarray with Sum at Least K
Reported Jan 4, 2025 · 1 source report
STAFF
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Meta
Shortest Subarray with Sum at Least K
Reported date not specified · Source window: 30d
Source snapshot: Oct 20, 2026
Source frequency score: 72.1. This is not an interview probability.
View source