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 string_s and string_t. You have to find the smallest window substring of string_t. The smallest window substring is the shortest sequence of characters in string_s that includes all of the characters present in string_t with the same frequency.
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.