# Longest Ideal Subsequence: Explained

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

## Key idea

A subsequence is ideal when every pair of adjacent chosen letters differs by at most k in the alphabet. DP on the last letter: dp[c] = 1 + max(dp[c-k..c+k]), process the string left to right. A 26-length array is enough.

## 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 * 26).

## Common mistake

Comparing each new letter to the first letter of the subsequence rather than the previous chosen letter, or requiring a contiguous substring.

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