Interview Guides Experiences

Interview Guides

All questions/Coding

Asked 2mo ago|

Micro1

Micro1

Minimum Window Substring Match

Medium

Stringstimed codingAlgorithms

Problem

Problem

Given two strings s and t, return the smallest substring of s that contains every character in t, including duplicates. If no such substring exists, return an empty string. The input and output are both strings, and character frequency matters.

Constraints

1 <= len(s) <= 10^5
1 <= len(t) <= 10^5
s and t consist of English letters
A valid answer, if it exists, is unique

Problem

Problem

Given two strings s and t, return the smallest substring of s that contains every character in t, including duplicates. If no such substring exists, return an empty string. The input and output are both strings, and character frequency matters.

Constraints

1 <= len(s) <= 10^5
1 <= len(t) <= 10^5
s and t consist of English letters
A valid answer, if it exists, is unique

Practice Python

Python 3.10

Open on desktop for the full Python editor with syntax highlighting and autocomplete.

Up next

Swiggy

Minimum Window Substring MatchMedium

Salesforce

Minimum Window Substring MatchMedium

NVIDIA

Smallest Window Containing PatternEasy

Minimum Window Substring Match | Dataford Interview Questions