LeetCode 727: Minimum Window Subsequence
Problem Restatement We are given two strings, s1 and s2 . We need to return the shortest contiguous substring of s1 such that s2 is a subsequence of that substring. A subsequence means the characters appear in the same order, but they do not need to be adjacent. If multiple shortest substrings exist, return the one with the left-most starting index. If no valid substring exists, return an empty string....