Solution: Shortest Common Supersequence

Statement

You are given two strings, str1 and str2. Your task is to find the shortest common supersequence (SCS). The shortest possible string that contains both str1 and str2 as subsequences.

If multiple strings satisfy this condition, you may return any one of them.

Note: A string $s$ is considered a subsequence of another string $t$ if $s$ can be obtained by deleting zero or more characters from $t$ without changing the order of the remaining characters.

Constraints:

• $1 \leq$ str1.length, str2.length $\leq 10^3$ ...