Given two strings
str2, return the shortest string that has both
str2 as subsequences. If there are multiple valid strings, return any of them.
s is a subsequence of string
t if deleting some number of characters from
0) results in the string
Input: str1 = "abac", str2 = "cab" Output: "cabac" Explanation: str1 = "abac" is a subsequence of "cabac" because we can delete the first "c". str2 = "cab" is a subsequence of "cabac" because we can delete the last "ac". The answer provided is the shortest such string that satisfies these properties.
Input: str1 = "aaaaaaaa", str2 = "aaaaaaaa" Output: "aaaaaaaa"
1 <= str1.length, str2.length <= 1000
str2consist of lowercase English letters.