Fetching algorithms...

Minimum Window Substring Visualizer & Solution | Rulcode

115. Minimum Window Substring

Hard

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: s = "ADOBECODEBANC", t = "ABC"

Output: "BANC"

Explanation: The substring "BANC" contains all characters from "ABC" and is the shortest such substring.

Example 2:

Input: s = "a", t = "a"

Output: "a"

Explanation: The substring "a" contains the character 'a' from "a" and is the shortest such substring.

Example 3:

Input: s = "ADOBECODEBANC", t = "X"

Output: ""

Explanation: The string "ADOBECODEBANC" does not contain the character 'X', so there is no valid window.

Constraints:

Time Complexity

O(m + n)

Space Complexity

O(m + n)

Loading problem details...

rulcode

115. Minimum Window Substring

Hard

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: s = "ADOBECODEBANC", t = "ABC"

Output: "BANC"

Explanation: The substring "BANC" contains all characters from "ABC" and is the shortest such substring.

Example 2:

Input: s = "a", t = "a"

Output: "a"

Explanation: The substring "a" contains the character 'a' from "a" and is the shortest such substring.

Example 3:

Input: s = "ADOBECODEBANC", t = "X"

Output: ""

Explanation: The string "ADOBECODEBANC" does not contain the character 'X', so there is no valid window.

Constraints:

Time Complexity

O(m + n)

Space Complexity

O(m + n)

115. Minimum Window Substring

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

115. Minimum Window Substring

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases