# Find The Maximum Length Of Valid Subsequence I: Walkthrough

Find The Maximum Length Of Valid 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 valid when the parity of adjacent sums is constant (all even or all odd). That means either all elements share one parity, or they strictly alternate. The answer is max(count_even, count_odd, longest-alternating).

## 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, or forgetting the all-same-parity case.

## 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://linkjob.ai.