Minimum Window Substring with order


  • 0
    R

    Given a string S and a string T, find the minimum window in S which will contain all the characters in T, and should in the same order as in T.
    Other than Brute force, DP? KMP?


  • 0
    T

    Two pointers, and a multi-map.


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.