Table of Contents:

The Problem Introduction 0:00 - 1:31

Walking Through The Brute Force 1:31 - 4:19

Analyzing The Brute Force Solution 4:19 - 6:58

Lower Bounding The Brute Force 6:58 - 10:25

Let's Think Harder: Reapproaching Things 10:25 - 13:03

First Satisfying Window Found 13:03 - 13:51

We Now Make A Key Choice 13:51 - 17:43

Observing The Work The More Optimal Solution Does 17:43 - 19:25

Time Complexity 19:25 - 20:35

Space Complexity 20:35 - 21:36

Wrap Up 21:36 - 22:14

Code: https://github.com/bephrem1/backtobackswe/blob/master/Hashtables/MinimumWindowSubstring/MinimumWindowSubstring.java

Leetcode Link: https://leetcode.com/problems/minimum-window-substring/

Elements of Programming Interviews: 13.7