Shortest Common Supersequences with Unique Character Frequencies
Given an array of strings
words, find all possible character frequency distributions of its shortest common supersequences (SCS). A shortest common supersequence is a string of minimum length that contains each string in words as a subsequence. Two supersequences are considered identical for this problem if one is a permutation of the other (i.e., they have the same character counts). Return a 2D array freqs where each freqs[i] is an integer array of size 26 representing the frequency of each lowercase English letter ('a'-'z') for a unique SCS multiset. You may return the frequency arrays in any order. Constraints: 1 <= words.length <= 8 1 <= words[i].length <= 12 words[i] consists of lowercase English letters.JavaDPMemoizationDFSHashMapHashSet
00