Find the shortest window in s containing every character of t (with
multiplicity). The trick that keeps it O(n): a formed / required counter tracks how many
distinct characters are fully satisfied, so you never rescan the whole frequency map. Expand
right until valid, then contract left as far as it'll go.