Longest Unequal Adjacent Groups Subsequence II
You are given a string array words, and an array groups, both arrays having length n.
The hamming distance between two strings of equal length is the number of positions at which the corresponding characters are different.
You need to select the longest subsequence from an array of indices [0, 1, ..., n - 1], such that for the subsequence denoted as [i0, i1, ..., ik-1] having length k, the following holds:
- For adjacent indices in the subsequence, their corresponding groups are unequal, i.e.,
groups[ij] != groups[ij+1], for eachjwhere0 < j + 1 < k. words[ij]andwords[ij+1]are equal in length, and the hamming distance between them is1, where0 < j + 1 < k, for all indices in the subsequence.
Return a string array containing the words corresponding to the indices (in order) in the selected subsequence. If there are multiple answers, return any of them.
Note: strings in words may be unequal in length.
Example 1
Input
words = ["bab","dab","cab"], groups = [1,2,2]Output
["bab","cab"]A valid longest subsequence is [0, 2], since groups[0] != groups[2], the words have equal length, and their hamming distance is 1.
Example 2
Input
words = ["a","b","c","d"], groups = [1,2,3,4]Output
["a","b","c","d"]The subsequence [0, 1, 2, 3] satisfies both conditions and has the longest possible length.
Constraints
- 1 <= n == words.length == groups.length <= 1000
- 1 <= words[i].length <= 10
- 1 <= groups[i] <= n
- words consists of distinct strings.
- words[i] consists of lowercase English letters.