# Subarray Product Less Than K: Interview Notes

Subarray Product Less Than K shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sliding window shrinking while the product is >= k; add (right-left+1) good subarrays ending at right.

## 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 answer, sliding window, stack, or in-place rewrite) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Forgetting to reset the product after zeros or empty windows when k<=1.

## 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 this tool.