Sliding Window

Summary

A technique for efficiently processing contiguous subarrays/substrings by maintaining a moving 'window' instead of recomputing from scratch for every position.

How to Learn This

1Solve 'maximum sum subarray of size k' using the sliding window technique.
2Practice both fixed-size and variable-size sliding window problems.
3Recognize sliding-window-shaped problems: anything about a contiguous subarray/substring with a constraint.

Backtracking

Greedy

More topics in Data Structures & Algorithms

Arrays Strings Linked List Stack Queue HashMap Heap Tree Graph Binary Search Recursion Backtracking Greedy Dynamic Programming Sorting Searching

Stuck on this topic? Ask an Insider

Get 1:1 guidance from people who've walked this exact path — free on the InsideEdge app.

Download