Minimum Window Subsequence Problem

Minimum Window Subsequence Problem — ExecCode Hard DSA Practice

Solve the Minimum Window Subsequence problem on ExecCode. Free online hard DSA practice in Arrays - Basics. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Minimum Window Subsequence. Two pointers forward/back for subsequence window. For Minimum Window Subsequence, focus on the exact input variables, return only the requested value, and preserve the required time complexity for the intended pattern.

Examples

Input {"s1": "abcdebdde", "s2": "bde"}; Output bcde

Constraints

1 ≤ n ≤ 10^5

Practice Minimum Window Subsequence free on ExecCode. Browse DSA problems, topic map, and placement guides.