MetaCoding·25 minMembers
Minimum Window Substring
Members only
LC 76 — find the shortest substring of `s` that contains every character of `t` (counts respected). Asked as the second phone-screen problem in a recent SWE loop; missing the optimal-window approach g...
SWE
string
sliding-window
hashmap
hard
Frequency
Single report · New
Last asked
2026-04-15
Stage
phone-screen
Log in to continue reading the full content
