# Longest Unequal Adjacent Groups Subsequence II: Practice Notes

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

## Key idea

Now words also have different lengths and Hamming-distance constraints: adjacent chosen words must have different groups, the same length, and Hamming distance 1. DP: dp[i] is the longest chain ending at i; transition from all earlier j that satisfy the three constraints; reconstruct via parent pointers.

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

## Common mistake

Using only the group-alternation rule from part I and ignoring length/Hamming, or requiring contiguous words.

## 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 multilingual AI interview assistant.