Window String :
Difficulty Level : Medium
Submissions : 310
Asked In :
Marks :100
: 3 | : 0
Given two strings 's' and 't' containing characters from a to z 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 ""'.
Input
The first line of input contains string s ($$$1 \le S \le 1e4$$$). Second line contains a string t ($$$1 \le t \le 1e4 $$$)
Output
For each output print the substring of the minimum window.
Example
Input
adovecodebanc abc
Output
banc
