Loading repovive.com/roadmaps/fundamental-algorithms
Roadmaps
Fundamental Algorithms
Sliding Window
Problemset
Discussion
AI Helper
Sorting Algorithms
0/45
Binary Search
0/40
Two Pointers
0/35
Sliding Window
0/34
1
Intro
2
Fixed-Size Window
3
Variable-Size Window
4
Longest Substring Without Repeating
5
Optimization - Jump Left Pointer
6
Quiz: Variable vs Fixed Window
7
Longest Substring with K Distinct
8
Minimum Window Substring
9
Pattern - At Most K
10
At Most K - Helper Function
11
Quiz: At Most K Pattern
12
Common Mistakes
13
When Sliding Window Applies
14
Quiz: When Sliding Window Applies
15
Maximum Average Subarray - Fixed Window
16
Maximum Average Subarray - Implementation
17
Longest Substring Without Repeating - Read Statement
18
Longest Substring Without Repeating - Variable Window
19
Longest Substring Without Repeating - Implementation
20
Quiz: Variable Window
21
Minimum Window Substring - Read Statement
22
Minimum Window Substring - Approach
23
Minimum Window Substring - Implementation
24
Quiz: Minimum Window
25
Sliding Window Maximum - Read Statement
26
Sliding Window Maximum - Monotonic Deque
27
Why Monotonic Deque Works
28
Sliding Window Maximum - Implementation
29
Quiz: Monotonic Deque
30
Longest Repeating Character Replacement - Read Statement
31
Longest Repeating Character Replacement - Key Insight
32
Longest Repeating Character Replacement - Implementation
33
Quiz: Character Replacement
34
Section Recap
Divide and Conquer
0/35
Backtracking
0/35
Complete Search
0/32
Bit Manipulation
0/35
4.1
Intro
100%
Tasks
Read Unit