76. Minimum Window Substring

Description:

Solution:

• countT, window will be what we "have" & what we "need"
• We update our window[c]. 
• Does window[c] satisfiy 'window[c] == countT'?

Time Complexity: O(n)