# Longest Harmonious Subsequence: Study Guide
Longest Harmonious Subsequence shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A harmonious subsequence's max - min == 1. Count frequencies; for each value x the best length using x and x+1 is count[x] + count[x+1] (if both exist). Order can be rearranged.
## 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 using max-min <= 1 (which would also count equal-only subsets).
## 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 interview copilot app.