JavaScript Algorithms and Data Structures: Sets - Shortest Common Supersequence
Shortest common supersequence is the shortest string that contains all the characters of two strings. Learn how to find the shortest common supersequence in JavaScript.
The shortest common supersequence (SCS) of two sequences X and Y is the shortest sequence which has X and Y as subsequences.
In other words assume we're given two strings str1 and str2, find the shortest string that has both str1 and str2 as subsequences.
This is a problem closely related to the longest common subsequence problem.
Example
Input: str1 = "geek", str2 = "eke"
Output: "geeke"
Input: str1 = "AGGTAB", str2 = "GXTXAYB"
Output: "AGXGTXAYB"
References
The Original Article can be found on https://github.com
#javascript #algorithms #datastructures #sets
4.10 GEEK