Loading your interview setup

Skip to content

Overview Resume Score

Practice

The Daily LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading

hard· sliding-window Mock interview

Minimum Window Substring

Given strings `s` and `t`, return the shortest substring of `s` that contains every character of `t` including duplicates. If no such window exists, return the empty string. If there are ties, return the leftmost one.

Examples

in: s = "ADOBECODEBANC", t = "ABC"

out: "BANC"

shortest window covering A, B, C

Constraints

1 <= len(s), len(t) <= 10^5
uppercase and lowercase letters

Hints

target: O(len(s)) time⌘↩ run · ⇧⌘↩ submit