Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in C++

Solution: Shortest Common Supersequence

Explore the dynamic programming approach to solve the shortest common supersequence problem. Understand how to use the longest common subsequence to build the shortest string containing two input strings as subsequences. Learn the reconstruction process and analyze the time and space complexity for an efficient C++ implementation.

We'll cover the following...

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 ss is considered a subsequence of another string tt if ss can be obtained by deleting zero or more characters from tt without changing the order of the remaining characters.

Constraints:

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