Відео

broo what was that... crazyyy

Bro code chef certificate badge valid or not

Good explanation ❤

Great explanation !!

Thank You! Brother 18th Sept, 2024

this was my first video i ever watched of your channel n you already gained my sub, clean n neat explanation

Bad explanation

Sir ebook is missing from description

It seems like you are making lot of efforts to explain which is very good, but even there is something missing, you are creating simple things complicated,....just go in order na,..first tell the intuition and the logic, then the code and finally the dry run,..

I have also preparing for redhat internship as devops role … can you guide me regarding this

Thanks man , Understood

great explanation for this problem. this is a great combinatorics problem.

Solution is giving TLE, can you solve this using memoisation!!

pls send link of the book

good explanation in whole youtube

what is the intuition behind picking minumum and moving from minimum index ?

Just a Small Correction , for those who is getting wrong answer with this algorithm - After , s.erase(val) , we have to also clear this value from the map i.e (mp.erase(val)) , Or else our answer may be wrong . Thankyou!!

That `num - 1` intuition was the hardest part for me

When you applied, please reply

Dp approach doesn't get submitted because NlogN is the constraints

Brilliant 😊😊😊, just subscribed 🎉

to convince ourselt to use merge sort !!! hell yeah brother I support you for the honestly im gonna watch you videos only for the honesty!!!!!!! because i was't really confused of how things arise in brain your honest made me feel i am not alone thanksssss!!!!!!!!!!!! a lot

Nicely explained👏

Thanks a lot

nice

This video is more helpful sir thank you. Actually I easy to understood in your way

great logical thinking👍

Thanks a lot

Great video!!!

Thank you so much bhaiya ❤❤

can you provide the source code for this pls

Not for beginners 💀☠️

We can simply Think like a DFS approach. Explore all the possible ways.

which book is mentioned in the description...the amazon link is not working

Thanks a lot bhai

great explanation bro

Thanks bro .. your explanation is just amazing . I did not aware of dp but even I understood this solution and even tried dry run and solved the question. Thank you

sir at 13:52 you mentioned that 2 has significance that it it mentioning the numbers that will come onto left after sorting, but that's wrong and not true for every element, reason why 6 has 1 as answer, it mentions number of smaller elements present on right side before sorting

i think we are moving minimum because at LeetCode We define the range [a, b] is smaller than range [c, d] if b - a < d - c or a < c if b - a == d - c. hence starting from minimum give correct answer

cant we do this using two pointers approach?

which college were u from bro??

ua-cam.com/video/3qN3bonkCG4/v-deo.html How It is possible because, if we return on first line then second will never been executed

Anaconda Spyder se run kiye to Module not found dikha rha h bhaiya

nice video

samjhana hai bhai, padhna nhi h bs

thank for your effort!

I don't get the second case of dn-1 when I think about it its tells me that it should be dn-3 cause if (a) gets i hat and i didn't get (a) then then we have a and i and another one who will get (a) hat so we fixed 3

Video starts at 03:25. Thank me later also put the video to 2x.

keep making video one of the best video for sliding window

can you please mention(problems links) which all other questions are based on this same approach ?