Exercises/#19 Minimum Window Substring
#19

Minimum Window Substring

HardπŸ”€ Strings
130 XP

Problem

Given strings s and t, return the minimum window substring of s that contains all characters of t. Return empty string if impossible.

Examples

Input: s = 'ADOBECODEBANC', t = 'ABC'
Output: 'BANC'

Input: s = 'a', t = 'a'
Output: 'a'
sliding-windowhash-mapstring
AI Assistantβ€” powered by AI

Unlock hints progressively β€” start gentle, go deeper only if needed.

πŸ’‘

Level 1: Gentle Nudge

A subtle direction

πŸ—ΊοΈ

Level 2: Approach

The algorithm to use

πŸ”

Level 3: Detailed

Step-by-step guidance

19 / 150

Your Solution

⚑ JavaScript

to save progress and use AI features