# Maximum Subarray Min Product: Study Guide

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

## Key idea

Min-product is min(sub)*sum(sub). For each index, take the largest window where it is the strict minimum (monotonic stack) and multiply its prefix-sum by that minimum.

## 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 window where the chosen value is not the minimum, or overflowing before the modulo.

## 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 coding interview assistant.