Given two strings s and t, return the smallest substring of s that contains every character of t, counting duplicates. Return an 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.