The sliding window

Stop recomputing from scratch. Keep a running answer over a moving range and update it in O(1) as it slides - turning an O(n*k) scan into O(n). Watch the window move.

18 min read

The sliding window is part of DSA in Java, visualized

Chapter 1 is free - you've seen how these lessons work. Unlock the full course once and keep it for life, including every chapter still being written.

  • Read any algorithm's Big-O cost on sight, and pick the faster approach
  • Implement the core data structures in Java from scratch, not from memory
  • Recognise the pattern behind an interview problem and reach for the right tool
  • Debug your own code by watching exactly what it does, step by step

One-time payment, lifetime access. No subscription.

Back to the course overview
The two-pointer technique Next: Strings are arrays too - coming soon