# Maximum Subarray Sum After One Operation: Explained

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

## Key idea

You may replace at most one element with its square. Kadane with two states: best ending here with no square used, and best ending here after using the square on this or an earlier element.

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

Squaring more than one element, or forcing a square when doing nothing is better.

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