Maximum in each window of size K
Problem statement
find the maximum for each and every contiguous subarray of size k
Example
Given : Array a[]={1, 2, 3, 1, 4, 5, 2, 3, 6} & K (i.e. Window Size)=3
Output= 3 3 4 5 5 5 6.
Hey @plazzy99 I would like to solve this issue using sliding window technique + Deque.
Language : I am interested to work in C++.
please assign this issue to me.
Maximum in each window of size K
Problem statement
find the maximum for each and every contiguous subarray of size k
Example
Given : Array a[]={1, 2, 3, 1, 4, 5, 2, 3, 6} & K (i.e. Window Size)=3
Output= 3 3 4 5 5 5 6.
Hey @plazzy99 I would like to solve this issue using sliding window technique + Deque.
Language : I am interested to work in C++.
please assign this issue to me.