Daily bit(e) of C++ #63, The common interview problem: minimum substring that contains all letters from a second string.