Minimum Window Substring · Compound Engineer

Minimum Window Substring

Find the shortest part of a string that contains every letter of another string. Grow a window until it is valid, then shrink it from the left for as long as it stays valid.

DSAProHardStep-through playerBy Aayush OstwalSolve on LeetCode ↗
Spotted a mistake in this lesson?Report an issue →