NeetCode #739LC-1092Hard2-D Dynamic Programming
← Back to All Problems#739 · #1092 · Shortest Common Supersequence(最短公共超序列)
📌 Problem Statement & Constraints
Given two strings
str1 and str2, return the shortest string that has both as subsequences. Constraints: 1 <= str1.length, str2.length <= 1000.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!