nikasulo

def sliding_maximum(k,array)
  #First part
  deque = Deque.new
  result = []
  
  #Second part
  #your loop goes here
  
  
  #Third and final part

nikasulo

for i in (0...array.length) do
  #rest of your code in here
end

nikasulo

deque.pushBack(array[i]) if deque.is_empty?

nikasulo

def set_max(deque,max)
    deque.pushFront(max)
end

nikasulo

max = get_max(deque)

nikasulo

def get_max(deque)
    deque.topFront
end

nikasulo

#check if the current item in the array is greater than what our max currently is
if max < array[i] 
    #if it is, first remove the max
    remove_max(deque)
    
    #now set the current index value of the array as the max
    set_max(deque, array[i])
end

nikasulo

def remove_max(deque)
    deque.popFront
end

nikasulo

max = get_max(deque)
        
if i >= k - 1
    add_max_to_result(result, max)
end

nikasulo

#check if what's currently in the back is a potential winner
if deque.topBack > array[i] 
    #if it is, store the runner up behind it
    deque.pushBack(array[i])
else
    #if it's not, remove it and then store the new winner in the back
    deque.popBack
    deque.pushBack(array[i])
end