LeetCode-Style Coding | Dataford Interview Questions

Solve a medium LeetCode-style coding problem.

Implement min_window(s, t) to return the shortest substring of s containing every character in t, including duplicate occurrences. Return an empty string if no such substring exists.

Input: two nonempty strings s and t. Output: the required substring, with any valid shortest result accepted when multiple answers exist.

Constraints

1 <= s.length <= 1000
1 <= t.length <= 1000
s and t contain uppercase and lowercase English letters
If multiple shortest windows exist, return any one of them

Function Signature

def min_window(s, t):

Your question is LeetCode-Style Coding. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem