Use a frequency map to track required characters. Expand until all characters are covered, then shrink to minimize.
Build a frequency map of t.
Track how many characters are "satisfied" (have enough count in window).
Expand right until all characters are satisfied.
Shrink left while maintaining validity, updating minimum.
Continue until right reaches the end.