Given strings s and t, find the shortest substring of s that contains every character of t, including duplicates (if t has two as, the window needs two).
Unlock this and every premium problem across all tracks — plus hidden-test grading, advanced AI engineering modules and new content every week.
Start 7-day free trial