Minimum Window Substring

This problem is part of solulu Pro

Given strings s and t, return the shortest substring of s that contains every character of t, counting duplicates (if t has two As, the window needs at least two). If there is no such window, return "". The answer is…