[Java] Deque | Solve Leetcode - Sliding Window Maximum

In this video, I'm going to show you how to use Deque to solve a Leetcode problem - 239. Sliding Window Maximum

Here’s a quick rundown of what you’re about to learn:

⭐️ Course Contents ⭐️
⌨️ (0:00) Question
⌨️ (2:15) Solution Explain
⌨️ (12:41) Code

In the end, you’ll have a really good understanding on Deque and questions that are similar to Deque.

[ganesh]

Sir when will be next video in datastructure series?

[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

[alexandersmirnov]

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