# Continuous Subarray Sum: Practice Notes

Continuous Subarray Sum shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Track prefix sums modulo k and remember the earliest index of each remainder. A repeat at least two steps later means a multiple-of-k subarray of length >= 2.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (two pointers, a sliding window, prefix sums, a monotonic stack, or binary search on the answer) and why a linear nested scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Requiring the subarray sum to equal k instead of a multiple of k.

## 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 assistant for technical interviews.