Given two strings s and t, find the shortest contiguous substring of s that contains every character from t (including duplicates). If no such substring exists, return "".

A substring must preserve order only insofar as it is contiguous — the characters from t may appear in any arrangement inside the window.