Видео

Excellent Video Thanks you great explanation.

This is such a neat explanation!

Thanks u have given very clear explaination

Simply count the frequencies in one iteration and then refill array using these frequencies in another iteration?

Tysm alisha, you have no idea how useful this video was to me <3

🙏🙏♥️♥️

In the example walkthrough, Even on Day 3, 2 transaction isn't possible right ? Why do we've to fill it then ?

very nice logic and good explantaion

🙏🙏♥️♥️

perfectly explained

Girl you are brilliant!

try to display more code in sigle page clearly

Good one , Thanks

Solved by your logic , watched till 4:56 only

This Video help me to clarify my doubts..

Thank u

Great work...everthing runs on brain...and thats why only brains communicate not mouth.

assalamualaikum mam. from bangladesh

you are so kind and lovely

Nice explanation ✨✨

aap bahut acha samjhate ho didi!!! thank u so much!!

thank you for intution

great explanation maam😀

Great explanation!!!

Excellent explanation, respect for you ❤❤

amazing video didi!! thank u so much!!

thanks

this is the best explanation i ever got

good explanation

Please ma'm try to make videos in 1080 picxels 🙂

Ma'm your explanation is very well 😊

Can't this be solved better with prefix and suffix array in O(n) time ?

Why this video is two hours long? 😕

Eye opener for me. Just an observation - we don't even need to counteven. Because if the bit is zero in the answer then we need to do nothing in the loop as we have initialized the answer to zero to start with. But for the sake of explanation you had it - Really helps.

SUPERB explanation - watched this videos several times to understand the logic. Thanks a Million. The right most set bit (determined from the XOR of the two numbers) is the key and in the two numbers that are different one will have the right most bit set and the other one will not

Great logic and explaination....Thanks for the video..

That's a great explanation ,You nailed it I say. I watched 4 to 5 videos, But your's is best!!!

Can you please tell without giving values to ans matrix vector how we are using it's value like you have written v[j]=ans[i-1][j]+ans[i-1][j-1];

Thanks Alisha didi

Excellent

XOR definition was perfect. But how does it apply to this problem at hand was not adequately explained. Anyways - but your solutions especially in C++ are GEMS. Hard to find anywhere else.. python, javascript solutions are available all over ... but C++ hard to find. I would say you were the first one to solve so much in C++

nice one

khud pdh ke khud samjh ke khud code kar li...bhut bdhiya -_-

on the first approach with storing the left and right max arrays, is that aslo a term called memoization ?

great explanation i follow your playlist of each for problem solving

WHAT IS SPACE AND TIME COMPLEXITY OF THIS SOLUTION?...

Best solution

greatt

Amazing explanation! Thank you so much!

good explanation. thank you very much