DIY: Minimum Window Substring
Solve the interview question "Minimum Window Substring" in this lesson.
We'll cover the following
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.