Leetcode 1092. Shortest Common Supersequence

Find the shortest string that contains both input strings as subsequences — essentially merge them minimizing length by maximizing their overlap. This is solved by dynamic programming to compute the longest common subsequence and reconstruct the shortest common supersequence (O(n*m) time, where n and m ≤ 1000).