Minimum Window Substring at Snapchat
Hard46.9% acceptance
This problem has 87.5% frequency at Snapchat.
Problem Description
Given two strings `s` and `t` of lengths `m` and `n` respectively, return _the**minimum window**_ **_substring_** _of_`s` _such that every character in_`t` _(**including duplicates**) is included in the window_. If there is no such substring, return _the empty string_`""`. The testcases will be gen...
Read full problem and hints