Minimum Window Substring

Hash Tables

Sliding Windows



Given an array of characters and a string, implement a function that finds the smallest substring containing all the characters in the array. Also seen as: Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "".

Ready to practice with a mock interview?

Book mock interviews with engineers from Google, Facebook, Amazon, or other top companies. Get detailed feedback on exactly what you need to work on. Everything is anonymous, and you don't have to until you find a job.

Computer Dude