nikasulo

class Node
  attr_accessor :value, :next_node, :prev_node

  def initialize(value, next_node = nil, prev_node = nil)
    @value = value
    @next_node = next_node
    @prev_node = prev_node
  end
end

nikasulo

def is_empty?
  @first.nil?
end

nikasulo

def sliding_maximum(k, array)
    res = []
    for i in 0..array.length - k do
        max = array[i]
        for j in i...i+k do 
            max = array[j] > max ? array[j] : max
        end 
        res << max
    end   
    res

nikasulo

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

nikasulo

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

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