Problem - Minimum Window Substring

Given strings $s$ and $t$, find the minimum window in $s$ that contains all characters of $t$ (including duplicates). Return empty string if no such window exists.

This is LeetCode $76$. Use a hashmap to track character frequencies and a sliding window to find the minimum valid window.