What you'll learn: • Understand the core principles and common templates of Sliding Window and Two Pointers techniques. • Apply these patterns to solve a wide range of problems involving arrays, strings, and contiguous subsequences. • Develop strategies for both fixed-size and variable-size sliding windows. • Efficiently count subarrays/substrings and find optimal windows based on various conditions. • Tackle advanced challenges like Minimum Window Substring with confidence.
L3. Longest Substring Without Repeating Characters | 2 Pointers and Sliding Window Playlist
23:09
L4. Max Consecutive Ones III | 2 Pointers and Sliding Window Playlist
29:58
L5. Fruit Into Baskets | 2 Pointers and Sliding Window Playlist
30:02
L6. Longest Substring With At Most K Distinct Characters | 2 Pointers and Sliding Window Playlist
21:32
L7. Number of Substrings Containing All Three Characters | 2 Pointers and Sliding Window Playlist
19:40
L8. Longest Repeating Character Replacement | 2 Pointers and Sliding Window Playlist
25:21
Quiz: Module 2: Character String & Array Problems with Sliding Window
10 min
L9. Binary Subarrays With Sum | 2 Pointers and Sliding Window Playlist
20:27
L10. Count number of Nice subarrays | 2 Pointers and Sliding Window Playlist
4:54
L11. Subarray with k different integers | 2 Pointers and Sliding Window Playlist
20:49
Quiz: Module 3: Subarray Sums & Counts with Sliding Window
10 min