# Shortest Subarray With Sum At Least K: Explained

Shortest Subarray With Sum At Least K shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Build prefix sums. Keep a monotonic increasing deque of prefix indices; for each j, pop left while pref[j]-pref[deque.left] >= k to shrink the candidate, then pop right while pref[j] <= pref[deque.right] (those cannot beat j later).

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Using a standard positive-only sliding window, which breaks when the array contains negatives.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI job search and interview copilot.