All challenges
Algorithm challenge · DSA
Minimum Window Substring
Difficulty
hard
Time
~40m
Format
Single
Grading
Auto-graded
#python#javascript#typescript#go#java#cpp#rust#dsa#sliding-window#strings
Mission file // read carefullyhard
Given strings s and t, return the shortest substring of s that contains every character of t (including multiplicity). If none exists, return the empty string. The minimal window is unique for the given inputs.
Example
s = "ADOBECODEBANC", t = "ABC" => "BANC"
Build with
minWindow(s: string, t: string) → stringPythonJavaScriptTypeScriptGoJavaC++Rust
5 tests · 2 hidden
Auto-graded on submit
Start challenge
Sign in to save your progress.