← Back to Games

K-Window Slayer

Slide a fixed-size window to find maximum sum!

3
Window Size (K)
-
Current Window Sum
-
Maximum Sum Found

🐢 Brute Force O(n × k)

Recalculate sum from scratch for each window position. Sum all K elements every time.

for each window position:
  sum = 0
  for i in window:
    sum += arr[i]

🚀 Sliding Window O(n)

Reuse previous sum! Just subtract leaving element and add entering element.

newSum = oldSum
        - arr[left]
        + arr[right]

Window Sums Found

Slide the window to see sums...