Given two string a and b. FInd out the minimum length substring k of a such that k contains all the characters of b. Minimum window problem