265. Minimum Window Subsequence (Length)

Given strings s and t, return the length of the minimum contiguous substring (window) of s such that t is a subsequence of that window. If there is no such window, return 0. If multiple windows have the same minimum length, the length is unique anyway. Input: '"s", "t"'.

Input: '"s", "t"'.

Output: Integer — minimum window length or 0.

Examples

Input: "abcdebdde", "bde"
Output: 4
Explanation: 'bcde' is the shortest window containing 'bde' as a subsequence.

Input: "abc", "abc"
Output: 3
Explanation: Whole string.

Input: "abc", "d"
Output: 0
Explanation: No window.

Constraints

• 1<=s.length<=2*10^4
• 1<=t.length<=100

Asked by