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$

• str1 and str2 consist of lowercase English letters.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.