# Maximum Alternating Subsequence Sum: Walkthrough

Maximum Alternating Subsequence Sum shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

The alternating sum of a subsequence is even-indexed terms minus odd-indexed terms (0-based in the subsequence). Maximize it. Greedy/DP: you always want peaks on even positions and valleys on odd ones; equivalently dp_even / dp_odd tracking the best sum ending with an even or odd count. A one-pass greedy that adds every ascent also works because you can always extend the subsequence to capture a positive difference.

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

Requiring the subsequence to be contiguous (that is a different problem) or starting the alternating signs on the wrong index.

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