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

Solution: Shortest Common Supersequence

Explore the solution to finding the shortest common supersequence (SCS) of two strings using dynamic programming. Understand how to build and use a longest common subsequence (LCS) table to reconstruct the SCS, and learn to efficiently implement this algorithm in C++ with time and space complexity considerations.

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