Minimum Window Substring
Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "".

30:00

Minimum Window Substring
hard
Topics
Companies

Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "".

Example 1:
Input: {"s":"ADOBECODEBANC","t":"ABC"}
Output: BANC
Constraints:

  • m==s.lengthm == s.\text{length}

  • n==t.lengthn == t.\text{length}

  • 1≤m,n≤1051 \leq m, n \leq 10^5

  • s and t consist of uppercase and lowercase English letters.

Input
arr ={"s":"ADOBECODEBANC","t":"ABC"}

Start

A

L

D

O

B

E

C

O

D

E

B

A

N

C

Have / Need
0 / 3
Min Window
-
Target Counts
A:1
B:1
C:1
Window Counts
Variables
No variables to display
DepthFunction Call
Stack empty
0/45