Given strings S and T, find the minimum window subsequence of S which contains T as a subsequence, in order. Return the empty string if no such window exists.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.