76. Minimum Window Substring
Question

Code
- keep a sliding window
- one hash map for key, one for current window
- change the need and have variable accordingly
class Solution(object):
def minWindow(self, s, t):
if t == "":
return ""
countT, window = {}, {}
for c in t:
countT[c] = countT.get(c, 0) + 1
have, need = 0, len(countT)
l = 0
res, resLen = [-1, -1], float("inf")
for r in range(len(s)):
c = s[r]
window[c] = window.get(c, 0) + 1
if c in countT and window[c] == countT[c]:
have += 1
while have == need:
if (r - l + 1) < resLen:
res = [l, r]
resLen = (r - l + 1)
window[s[l]] -= 1
if s[l] in countT and window[s[l]] < countT[s[l]]:
have -= 1
l += 1
l, r = res
return s[l:r + 1] if resLen != float("inf") else ""