---
title: "Discussion on \"Sliding Window Technique: From O(n·k) Scans to O(n) in One Pass\" | Hashnode"
description: "Discussion on \"Sliding Window Technique: From O(n·k) Scans to O(n) in One Pass\". Eliminate redundant subarray re-scanning by maintaining a running aggregate across an expanding and shrinking boundary."
url: "https://hashnode.com/posts/sliding-window/69c8c2417784a79a02beed2e"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Sliding Window Technique: From O(n·k) Scans to O(n) in One Pass](https://abstractalgorithms.hashnode.dev/sliding-window?utm_source=hashnode&utm_medium=feed)

Eliminate redundant subarray re-scanning by maintaining a running aggregate across an expanding and shrinking boundary.

Mar 29 · 16 min read · abstractalgorithms.hashnode.dev  
Updated Jun 18  
Read the article

-   [#algorithms](https://hashnode.com/tag/algorithms)
-   [#coding-interview](https://hashnode.com/tag/coding-interview)
-   [#data-structures](https://hashnode.com/tag/data-structures)
-   [#java](https://hashnode.com/tag/java)
-   [#sliding-window](https://hashnode.com/tag/sliding-window)

## Written by

[Abstract Algorithms](https://hashnode.com/@abstractalgorithms)

@abstractalgorithms

  
[View profile](https://hashnode.com/@abstractalgorithms)

Exploring the fascinating world of algorithms, data structures, and software engineering through clear explanations and practical examples.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
