2762. Continuous Subarrays | 5 Approaches | Map | Deque | 2 Pointers

[@ARYANMITTAL]

Very Long video, i'll recommend if you are short on time, follow this priority to look at the approaches 1. Approach 3 - Using Maps (Most Intuitive) 2. Approach 4 - Using Deque (Must know Concept) 3. Approach 1 & 2 (Just for Interview - Be very Quick) 4. Approach 5 - Most BAKWAS approach Agar accha lage to plssssssssssss like thok dena plssss 🥺❤

[@TheDailyWordChannel]

Bro try to make begginer friendly even the time taken is high if so we easyly understand

[@vaibhav8257]

Nice to see you Back

[@mageshyt2550]

love the two pointer explanation 💝

[@abhiram_06]

explanation >>>

[@nagasrisaichaitanyakolluri8173]

when i struggle , your videos r wat to go

[@DeepakMittal-gj3ki]

Very Nice

[@mandartule]

[@sarankumaar6009]

if anyone wondering why the window is always less than or equal to 3 is because the problem says nums[i] can be in range of 0

[@Axel.Blazer]

in your approach 5 i thought we could do better by storing just the last index of curmin and curmax..that'd speed it up a bit i guess but idk

[@SreeCharan-dx7oc]

vielen dank

[@GauravPrasad-m1j]

bitte

[@Nutrino259]

I did it using Priority queue but got scared after seeing the tags of this question!!!

[@shashiala1646]

tags section is messed up!

[@swapnil_tayal]

which mic are you using ? thanks in adanvace

[@JitendraSingh-t7w9c]

I think in deque approach shrinking the window by hop is same as shrinking it one by one. Please help if anyone have code of shrinking window one by one.

[@MD_SAMEER___]

Really appreciate your way of explanation man! 🫡