# Constrained Subsequence Sum: Practice Notes

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

## Key idea

DP[i] = nums[i] + max(0, max(DP[j] for j in [i-k, i-1])). The sliding max of the last k DP values is maintained with a monotonic deque, just like jump-game VI.

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

Kadane without the "at most k apart" constraint, or a nested O(n k) scan that TLEs.

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