Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). 1. If there is no such window in S that covers all characters in T, return ...

Given a string S with only lowercase characters. Return the number of substrings that contains at least k distinct characters. Explanation: Any substring whose length is not smaller than 3 contains a, ...