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

Shortest Common Supersequence

Explore how to determine the shortest common supersequence (SCS) of two strings by applying dynamic programming. Understand subsequences, constraints, and methods to solve this problem effectively, preparing you for dynamic programming questions in coding interviews.

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