Solution: Shortest Common Supersequence

Explore the method to solve the shortest common supersequence problem by applying dynamic programming. Learn to build and use the longest common subsequence table to efficiently construct the shortest string containing both input strings as subsequences while preserving order. Understand the step-by-step approach for filling the DP table and reconstructing the solution. This lesson helps you master key optimization techniques and coding patterns useful in coding interviews.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

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$ ...