Maximum element in every window of size k

#1

i am not able understand the working of the algorithm

#2

@ennayawalia06 hey in this question dequeu approach will be use ,you have to travesre all array and take only k elements in deque and remove unnecessary elements or ignore smaller elemnts ,dry run this approach ,you will get it and also again see this video.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.