fucking legend lov u adore u

Such clear explanation and visual drawings are the reason why u r ny go to person for DSA , you are #1 man

Well explained dude! 😂❤

very clear explaination.

I'm satisfied with the proof on the time complexity. What about the space complexity? May I ask why it is O(logN)?

you are awesome keep going bro

Thank you ... This is very clear

Thank you very much

thank you very much

thank you very much

Thanks 😢❤

bhai ye to pta hi hota hai you need to find the ans without using inorder aise to bst ke saare que hote hi hai inorder se interview mai aise allowed nai krte

How to contact for you. I come to VIỆT NAM

didn't notice new intro look. nice!

Such a great explanation

😂😂😂 bro simply too good 👍

Best explanation I found!

Great explanation. Thank you

Sir, where i can find the problems

can u send the code for this problem..i got wrong an"Could you please provide the code for this problem? I received an incorrect answer." swer

Best solution is still O(N)

hay chi chi rô

I cant be the only one who is searching for indian teachers since they always explain everything faster and simpler which makes understanding the problems we have way easier, so yeah sir really thank you for this video, you have helped me greatly, I wish my teachers were half as good as you at explaining stuff

Thank you very much

Awesome explanation, I had trouble understanding this earlier but now i get it

if level starts with zero, then we can say that no. of nodes should be 2^n, where n is the level

thanks

what if there are more than one element is missing in an unsorted array

Better than striver

Well explained

Very nice explanation bro

4:04 Sir, One Small correction in the video. The closeset sum can be great than the goal , but should be closest.

How to loop over within a single string in the vector of strings, to store their character frequency in the hashmap ? As we don't have another iterator to go through each character within a selected string

♡

Thanks, it was really helpfull explanation!

Beautifully explained and clean code

Video title wrong it has to be rules and not facts

complexity of explanation is high

man ur the besttt

Why ++left, and not left ++

Nice Thumbnail

Thank you for explaining the time complexity of building a heap that I've been struggling with

great dude , loved the beautiful explanation

I feel lot of detailing is missed in this explaination. If some one wants a good understanding of kmp algo and how it works, please refere CodeNCode channel. Expected a better and thorough explaination sir.

quality content in just 9 min . wow . have no word ❤❤❤❤❤

Di they fixed error 12?

we can ignore p3, since p3 will always be p1+p2.

ni madda ki salam anna . super explain chesav

Python soln def rangeBitwiseAnd(left: int, right: int) -> int: count = 0 while left != right: left = left >> 1 right = right >> 1 count += 1 return left << count

i just have one question, why are we checking parent when we do not check in Tarjan's Algorithm ?