Sliding Window Visualization

Fixed-size max-sum | Variable-size longest-no-repeat

Configuration

Problem: Input: k:

in window [l..r]

entering (right++)

leaving (left++)

duplicate detected

Array

Window State

empty

Step Info

Choose a problem, load input, then press Step or Run.

Speed:

Statistics

0

n (input length)

0

steps taken

0

left ptr

-1

right ptr

0

window width

0

current answer

Big-O

Aspect	Sliding	Brute
Time	O(n)	O(n·k) or O(n²)
Space	O(1) or O(alphabet)	O(1)
Per step	O(1) amortized	O(k)

Operation Log