News
727. Minimum Window Subsequence (Hard) Given strings S and T, find the minimum (contiguous) substring W of S, so that T is a subsequence of W. If there is no such window in S that covers all ...
# Given strings S and T, find the minimum (contiguous) substring W of S, so that T is a subsequence of W. # If there is no such window in S that covers all characters in T, return the empty string "".
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback