Back to Paths
🪟
Sliding Window & Two Pointers
Learn the two patterns that turn most O(n²) array and string problems into O(n). Each module builds the intuition first, then drills it with graded problems.
3
Modules
10h
Duration
15
Students
500
Coins Reward
Course Modules
1
Two pointers from both ends
Shrink the search space from both sides of a sorted array.
2
Fixed and variable windows
Grow the right edge, shrink the left edge.
3
Greedy scans
One pass, one decision per element.