Maximum in each window of size K

[puneetkaur2929]

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.

[github-actions[bot]]

Hi 😄, @puneetkaur2929 Thanks for creating issue at AlgoTree, do read and follow the Code of Conduct and the Contribution Guidelines while contributing. Refer to PR's which has been merged earlier in AlgoTree Click Here Like, How many File they have changed?, Which type of files need to be change? and many more.

[github-actions[bot]]

Hi 😄, thanks for creating issue at AlgoTree, do read and follow the Code of Conduct and the Contribution Guidelines while contributing.

[vatsalkesarwani12]

Contribution time has ended 😄

[SunilKumar-K]

can I know Issue is resolved or not @vatsalkesarwani12 ?