Sliding Window Algorithm // LeetCode 340 and 76

Today we are talking about the sliding window algorithm (maybe the GIF in my post gave it away? ☺️). You use dynamic programming to break down a large series of data into smaller chunks (windows) that you can use to modify state and find solutions to the larger problem. The keys are to figure out what state you want to track, how you want to iterate through the data, and how you want to update that state as you are iterating.

0:00 Introduction
1:17 Algorithm
5:48 General Steps
8:28 Basic Example
17:46 LeetCode 340
40:36 LeetCode 76
55:20 Conclusion