Maximum Of K- size subarrays (Deque)

max_of_k_size_sub_array.rb

# question
# quertion url
# https://www.hackerearth.com/practice/data-structures/arrays/1-d/practice-problems/algorithm/maximum-of-k-size-subarrays-deque/

# Given an array A of size 'N' and an integer k, find the maximum for each and every contiguous subarray of size k.

# Input :

# First line contains 2 space separated integers 'N' and 'k' .
# Second line contains 'N' space separated integers denoting array elements.
# Output:

# Space separated Maximum of all contiguous sub arrays of size k.
# Constraints :

# 1<= N <=10^5
# 1<= Ai <=10^9
# 1<= k <=N
# #  sample input
# 9 3
# 1 2 3 1 4 5 2 3 6
# sample output
# 3 3 4 5 5 5 6





number_of_elements,size_of_sub_array = gets.chomp.split(' ').map {|d| d.to_i}
array_inputs = gets.chomp.split(' ').map {|d| d.to_i}
start = 0
arr = []
sz = array_inputs.size
while start <= (sz - size_of_sub_array)
	arr << array_inputs[start,size_of_sub_array].sort[-1]
	
		start += 1
end

puts arr.join(' ')