Minimum window Substring AND longest Substring with at most K distinct characters

Give a string S and a String T, find the minimum window in S which will contain all characters in T.