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

Shortest Common Supersequence

Explore how to find the shortest common supersequence (SCS) of two strings by using dynamic programming in C++. This lesson helps you understand how to combine two subsequences into the smallest possible string containing both, applying optimization techniques and constraints handling within a C++ coding environment.

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