Minimum window Substring AND longest Substring with at most K distinct characters
Oct 12, 2020•6 min•Season 1Ep. 5
Listen to this episode in Metacast mobile app
Don't just listen to podcasts. Learn from them with transcripts, summaries, and chapters for every episode. Skim, search, and bookmark insights. Learn more
Episode description
Give a string S and a String T, find the minimum window in S which will contain all characters in T.
For the best experience, listen in Metacast app for iOS or Android