Shortest substring containing chars
Given a lowercase string s and a lowercase string t, return the shortest substring (window) of s that contains every character of t including multiplicity (a character needed twice must appear at least twice in the window). If no such window exists, return the empty string. If multiple shortest windows tie, return the leftmost. Lengths up to a few thousand.
Implement
min_window_substring(s: str, t: str) → strExamples
in
["adobecodebanc","abc"]out"banc"What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 32 min
solution.py
InputExpectedGot
["adobecodebanc","abc"]"banc"not run yetsample