Sliding Window Maximum || Maximum of all subarrays of size k

[@manaskhare412]

I have seen striver video solution as well, but this explanation tells us the intuition, which is rarely seen in any youtube videos. Hats off to you.

[@raju_bugude]

Best Explanation(from introducing new data structure)

[@mahadishakkhor123]

Better then all other explanation on youtube , that i seen sofar

[@rajukachori9536]

maam is the best ....watch 5-6 video but didnt get this type of explainaion and so slowly and calm every step ...thankyou

[@VikashKumar-ui1hs]

Nice explanation, clear visual representations, and impressive coding skills. Much appreciated! Thanks:)

[@nileshmishra5482]

In beginning of video I got the vibe that this is the best explanation.. 💯💯💯

[@manishkumar-qn6lx]

Got it. Thanks for this video and for putting so much effort into explaining the answer using an interactive board. It's worth it!!

[@madanmohanpachouly6135]

I tried many videos to understand, but this helped me finally, thanks for ur efforts .

[@RishuSingh-d3b]

This is the real gem of TH-cam❤❤❤❤

[@saiyamarora4241]

Great video and visual representation

[@gitanjalikumari9262]

One of the best explanation.. thankyou so much😊

[@ShubhamSingh-iq5kj]

Great explanation . I always wanted someone to explain algo steps while coding also thanks again 🙏🙏

[@kaushikramabhotla4635]

Best Explanation so far for this problem :)

[@huzaifaansari6195]

best explanation.came here after watching 2 3 videos for the same question. Thanks for the video!

[@56sanjivanisingh58]

like srrly i have visited the websites and YT video but not understanding at the last by ur video i have understood thankkkkkkkkk youuuuuuuuu

[@manavarora2257]

Very nice explanation..

[@SirAkPandey]

you're the best. You always provide the best explanation 🙏🙏

[@durgeshkushwaha2534]

Really very good explanation .thank you so much❤❤

[@vamshireddy171]

much better explanation than striver

[@IgniteYoutheEngineer]

Seen 3 explanation and this better than all

[@akicr7]

One of the best explanation.

[@potlurisairaj6669]

after seeing your explanation understood something thank you

[@aaravanand2325]

Best of whole youtube

[@nimeshpareek953]

you deserve a like I was not able to understand this saw adiitya verma video twice

[@mdalmashalam885]

Thanks a lot for the intuition

[@omorfarouk5262]

maam you are best. Thank you for your effort.

[@prateekkanaujia7341]

Thank you for this great explanation :)

[@deveshgupta4689]

Amazing explanation!!

[@jayeshchaurasiya262]

Great explanation ❣️

[@pooja8116]

Best Explaination :)

[@drizzle01]

thanks! nicely explained!

[@vinamrasangal8436]

grt, grt, grt
grt=great !

[@NatureLover-oq6uc]

veery well explained...

[@gigachad2419]

3:56 how can we use Linked List Data Structure here?

[@mdimranhosen6674]

Great explanation💖

[@codingwithanonymous890]

Best explaination

[@MANOJKUMARAM-q2n]

I have the other solution but the complexity is same : class Solution:
def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]:
queue = deque()
count = 0
output = []
for i in range(len(nums)):
if len(queue) == 0:
queue.append(nums[i])
else:
while len(queue) != 0 and queue[-1] < nums[i]:
queue.pop()
queue.append(nums[i])
count += 1
if count == k:
output.append(queue[0])
if nums[(i + 1) - k] == queue[0]:
queue.popleft()
count -= 1
return output

[@anupam6045]

very nice explanation di

[@NagaVenkateshgavini]

proper explanation !!

[@basudebroy325]

Very very thanks didi..

[@bharathkumar5870]

thanks dude

[@MANOJKUMARAM-q2n]

class Solution:
def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]:
queue = deque()
count = 0
output = []
for i in range(len(nums)):
if len(queue) == 0:
queue.append(nums[i])
else:
while len(queue) != 0 and queue[-1] < nums[i]:
queue.pop()
queue.append(nums[i])
count += 1
if count == k:
output.append(queue[0])
if nums[(i + 1) - k] == queue[0]:
queue.popleft()
count -= 1
return output

[@MANOJKUMARAM-q2n]

Single for loop code

[@baazigaraxcode4994]

Love uhh mam❤️

[@sushantgupta4757]

thanku didi

[@raushankumar6993]

thanks

[@bhanu0774]

Best

[@vishaldhiman1625]

Can we use set instead of deque?

[@shalsteven]

set can't be modified isn't it?

[@dheerajsingh179]

This code is showing error

[@chiragsharma7022]

Yes bro it's showing an error. Please provide correct code mam

[@JohnWickea]

[4,3,11],k=3
showing wrong answer

[@manishkumar-uw5mw]

Lallontop ❤

[@DeepanshMaurya-w7i]

why i-k in line no. 21

[@jaykeer8662]

Same question

[@JohnWickea]

it's coz if the current max element(front) is present in the previous subarray as well ,so that means we have to delete/remove that element . gotcha?

[@NagaVenkateshgavini]

If you do nums[i-k], it equals the front of the deque. That means we moved to the next window.
Do it by yourself for the last window, you will understand.