Longest Unequal Adjacent Groups Subsequence II

Find the longest increasing subsequence of indices such that each adjacent pair of selected words has the same length, Hamming distance 1, and comes from different groups, and return the corresponding words. In other words, it's a longest subsequence problem with local adjacency constraints (same-length, Hamming distance 1, unequal groups) between consecutive elements.