# Longest Unequal Adjacent Groups Subsequence I: Explained
Longest Unequal Adjacent Groups Subsequence I shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Each word has a group 0/1; pick a longest subsequence of words whose adjacent groups differ (i.e. they alternate). Because any 0/1 alternation is possible by scanning in order, you can just pick greedily in order, or return all words if you always can skip a repeat group — actually the longest is obtained by taking one word from each run of equal groups? No: you may take at most the words that form an alternating sequence, which means you can take every word whose group differs from the last taken. Taking all such words in order is optimal.
## 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 chosen words themselves to be different, or only returning the groups array.
## 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 job search and interview copilot.