Sliding Window

Easy

Sliding Window

Sliding window is a technique to efficiently calculate partial sums of consecutive elements. It slides the window one step, subtracting the front and adding the back element.

📊 Complexity

Type	Value
Best	O(n)
Average	O(n)
Worst	O(n)
Space	O(1)

🏷️ Tags

Sliding WindowArrayO(n)

📖 Introduction

An algorithm that efficiently calculates partial sums by sliding a fixed-size window through an array. Instead of recalculating everything, it only updates the changing parts.

1/13

🪟Sliding Window Start

Find the maximum sum of 3 consecutive elements. Instead of recalculating everything, slide the window efficiently!

Sliding Window

Easy

Sliding Window

Sliding window is a technique to efficiently calculate partial sums of consecutive elements. It slides the window one step, subtracting the front and adding the back element.

📊 Complexity

Type	Value
Best	O(n)
Average	O(n)
Worst	O(n)
Space	O(1)

🏷️ Tags

Sliding WindowArrayO(n)

📖 Introduction

An algorithm that efficiently calculates partial sums by sliding a fixed-size window through an array. Instead of recalculating everything, it only updates the changing parts.

1/13

🪟Sliding Window Start

Find the maximum sum of 3 consecutive elements. Instead of recalculating everything, slide the window efficiently!

🪟Sliding Window Start

Sliding Window

Definition

Key Characteristics

Time Complexity

🪟Sliding Window Start

Sliding Window

Definition

Key Characteristics

Time Complexity