# Maximum Subarray Sum With One Deletion: Practice Notes
Maximum Subarray Sum With One Deletion shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Kadane with a second state that has already deleted one element: either delete this element and take the no-deletion best before it, or keep this element on top of a one-deletion prefix.
## 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
Deleting more than one element, or forgetting that plain Kadane (no deletion) is also allowed.
## 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 https://www.linkjob.ai/.