Skip to content

problem5.md

Latest commit

 

History

History
17 lines (12 loc) · 353 Bytes

problem5.md

File metadata and controls

17 lines (12 loc) · 353 Bytes

Problem 5: Minimum Window Substring

Problem Statement

Find the minimum window in string s that contains all characters of string t.

Input Format

  • Two strings s and t.

Output Format

  • The minimum window substring.

Constraints

  • 1 <= len(s), len(t) <= 10^5

Example

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