# Find The Maximum Length Of A Good Subsequence I: Practice Notes

Find The Maximum Length Of A Good Subsequence I shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A subsequence is good if it has at most k index-pairs of adjacent unequal values. DP on (index, last-value, remaining-changes) or compress values and track the best length per value for each change-count.

## 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^2 * k) for the small constraints.

## Common mistake

Counting the total number of distinct values instead of adjacent changes, or allowing more than k changes.

## 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 assistant for technical interviews.