Minimum window subsequence
Given strings s and t, return the minimum (contiguous) substring w of s such that t is a SUBSEQUENCE of w. If there is no such window, return the empty string. If multiple minimum-length windows exist, return the one with the left-most starting index. 1 <= len(s) <= 2*10^4, 1 <= len(t) <= 100.
Implement
min_window_subsequence(s: str, t: str) → strExamples
in
["abcdebdde","bde"]out"bcde"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 35 min
solution.py
InputExpectedGot
["abcdebdde","bde"]"bcde"not run yetsample