258. Minimum Window Substring

Given two strings s and t, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such window, return an empty string.

Example:
Input: s = "ADOBECODEBANC", t = "ABC"
Output: "BANC"

Note: The substring "BANC" includes one A, one B, and one C from string t.

Run this challenge interactively in Python or JavaScript when the app loads.