[Java] Deque | Solve Leetcode - Sliding Window Maximum

[@TheProximator]

Excellent : ) Thank you very much

[@EricProgramming]

TheProximator, Thank you very much for your support!

[@ganesh2075]

Sir when will be next video in datastructure series?

[@EricProgramming]

Which data structure would you like me to do next?

[@amol_]

I this code will not work, incase of duplicate as during shrink operation you will never know the element which we are removing is it same max or we have duplicate also in windw. storing index is make sense

[@SamarAshrafii]

No, it is working. I check it and it is actually easier than to keep indexes. Thanks for this video. You explained very well.

[@alexandersmirnov4274]

you should store into dequeue indices of elements rather than elements itself

[@SamarAshrafii]

Not necessarily.This code works well.