76. Minimum Window Substring(Hard)
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).
158.Read N Characters Given Read4 II — Call multiple times (Hard)
The return value is the actual number of characters read. For example, it returns 3 if there is only 3…