minimum_window_subsequence

README

< Previous 　　　　　　　　　　　　　　　　 Next >

727. Minimum Window Subsequence (Hard)

Related Topics

[Dynamic Programming] [Sliding Window]

Similar Questions

1. Minimum Window Substring (Hard)
2. Longest Continuous Increasing Subsequence (Easy)

Hints

Hint 1

Let dp[j][e] = s be the largest index for which S[s:e+1] has T[:j] as a substring.