# Maximum Product Subarray: Explained

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

## Key idea

Track both running max and min (a negative can flip them) and reset on zero.

## 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

Keeping only the max lets a later negative waste a large-magnitude min.

## 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 www.linkjob.ai.