โ† Amazon questions
CodingMedium

Find the smallest window in a string containing all characters of another

Filed under Amazon

Given two strings s and t, find the minimum window substring in s that contains all the characters of t in complexity O(s + t). If there is no such window, return the empty string "".

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.