Problem 76 · Hard

Minimum Window Substring

Find the shortest slice of a string that contains every character from a second string. The visual slides a window and shrinks it while it stays valid.

Open the interactive visualisation