← Back to Games

Window Walk Challenge

Expand and contract a variable-size window with two pointers!

Sum ≤ Target

Keep window sum under limit

≤ K Distinct

Limit unique elements

Longest Valid

Find max window size

Left Pointer (i)
0
Right Pointer (j)
0
Window Size
1
Window Sum
0
Target
20
Constraint Status
🎮 Window Operations

Acquire: Expand right to include more elements
Release: Shrink from left to reduce window

📜 Operation Log
Operations will appear here...
✓ Valid Windows Found
Valid windows will appear here...