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 🥺❤
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.
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 🥺❤
Bro try to make begginer friendly even the time taken is high if so we easyly understand
love the two pointer explanation 💝
great video with the dry run example. the deque diagram was a little confusing but good explanation overall
amazing and detailed explanation 👏👏
Nice to see you Back
explanation >>>
when i struggle , your videos r wat to go
Very Nice
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
which mic are you using ? thanks in adanvace
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
a small correction, window could be of any size, the distinct elements in the window could be max 3
vielen dank
bitte
I did it using Priority queue but got scared after seeing the tags of this question!!!
tags section is messed up!
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.
Really appreciate your way of explanation man! 🫡