Dsa
Sliding Window
Medium
Minimal Distinct Window
Given a string s and a set of characters t, find the minimal window substring of s that contains all characters in t. If there is no such window, return an empty string.
Example:
Input: s = 'ADOBECODEBANC', t = 'ABC'
Output: 'BANC'
Key concepts
sliding_windowhashmapsubstring
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now