Window Titan: Max Subarray Power

📋 OBJECTIVE

Find the maximum element in each sliding window of size K. Use a deque to efficiently track maximums in O(n) time!

📝 ALGORITHM

function maxSlidingWindow(arr, k) {
  deque = []  // stores indices
  result = []
  
  for (i = 0; i < n; i++) {
    // Remove out of window
    if (deque[0] <= i - k)
      deque.shift()
    
    // Remove smaller from back
    while (arr[deque.back] < arr[i])
      deque.pop()
    
    deque.push(i)
    
    // Window complete?
    if (i >= k - 1)
      result.push(arr[deque[0]])
  }
}

💡 KEY INSIGHT

The deque always stores indices in decreasing order of values. Front = maximum. When a larger element comes, smaller ones can never be max again!

🏔️ MOUNTAIN RANGE Configure and start sliding!

Array:

K =

Input Array

Click "Step" or "Auto Run" to start the algorithm!

📊 DEQUE (Indices of potential maximums)

Empty

🏆 WINDOW MAXIMUMS

No results yet...

🏔️ WINDOW TITAN

Success!