Minimum Window Substring
#76
Hard
Sliding Window
O(n + m)
O(m)
Facebook
Amazon
Microsoft
Uber
Problem Description
Given two strings s and t, return the minimum window substring of s such that every character in t is included in the window.
Given two strings s and t, return the minimum window substring of s such that every character in t is included in the window.