1243. Minimum Window Subsequence

Given strings s1 and s2, find the shortest contiguous substring of s1 that contains s2 as a subsequence. If several are equally short, return the leftmost one; if none exists, return the empty string. The input is JSON {s1, s2}.

Input: JSON {s1, s2}.

Output: String — the minimum window substring, or empty.

Examples

Input: {"s1":"abcdebdde","s2":"bde"}
Output: bcde
Explanation: 'bcde' is the shortest window.

Input: {"s1":"abc","s2":"d"}
Output: 
Explanation: No window exists.

Input: {"s1":"a","s2":"a"}
Output: a
Explanation: Single character.

Constraints

• 1<=|s1|<=2*10^4
• 1<=|s2|<=100

Asked by