DSAGeeks
Minimum Window Substring
Hard

Problem Statement

Given two strings, s and t, find the minimum window in s which will contain all the characters in t in complexity O(n).

Examples

1Example 1
Input:
{ "s": "ADOBECODEBANC", "t": "ABC" }
Output:
"BANC"
2Example 2
Input:
{ "s": "a", "t": "a" }
Output:
"a"
3Example 3
Input:
{ "s": "a", "t": "aa" }
Output:
""
Loading...

Sign in to Run Code and Submit