DIY: Minimum Window Substring

Solve the interview question "Minimum Window Substring" in this lesson.

Problem statement

Suppose you are given two strings, say S and T. You have to find the smallest window substring of T. The smallest window substring is the shortest sequence of characters in S that includes all of the characters present in T with the same frequency.

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.