Given two strings s and t , return the shortest substring of s that contains every character of t , counting multiplicity (if t has two A s, the window must too). If no such substring exists, return the empty string . If several shortest windows exist, return the one that starts earliest in s . Input format Input is [s, t] , e.g. [ ADOBECODEBANC , ABC ] .