Greate video, Thanks a lot!

i think you're the love of my life

Thank you!!!

Hath Mila Bhai 🤝

why are you explaining things better than the people who get paid to do it? why do I have to pay 1800 for college credit to learn the material on youtube?

Amazing wonderfully explained

super super love this

Well done

Thank you so much!

1. why we are ONLY able to put the new left/right Parentheses at the rightest side every time? 2. According to the above limitation, why we could say the final level leafs are the answer? Thanks 🙇‍♂

Nice explanation :)

16:25 he makes this feel so epic.

lol got this question for amazon applied scientist role 2 years ago and i didn't know it was LRU cache

I've struggled with the knapsack problem for so long. I learned a lot from your video. Thank you!

Great Explanation

TY so much great explanation and I dont even speak english that well! Love from italy

Thank you so much

at 6:00 I was like, say no more => Subscribed. fkn love the way explain stuff man

good job brother very appreciate it

Best expiation ever sir. Thank you so much for your efforts.

Thank you, sir! You explained it with great energy and clarity.

Sorry but show big trees not that small stuff

nice, thank you

Is it possible to solve this question without looking at solution ?

Very detailed explanation with a big array! Thank you .

WOW

Good channels are often underrated man! I am glad I explored your channel and got a ton of quality information, hope your channel grows!!

Hummm. This is so weird.

Very Good!

Such quality video from a channel but so little videos to watch. Lol comeback man.

Amazing

Brother, I have been struggling to understand this concept, GOD BLESS YOU 🙏.

explaination hella good

Finally, I understand this one! Thank you, you're a hero.

The code never in the description 😁

My advice would be do drink less coffee and talk slowly. It's not a race

I made a video about this one: kzbin.info/www/bejne/a5WumYOPd6-crrc

Best explanation of this thank you!

How is trees implementation using plantuml

<3

this lecture is shit

The Empty_Entry should be inside the for loop , isn't it ?

Les hoooooooooomes ❤️

I guess this is the best video explaining lcs.

I tried understand one, two, tree times, I saw the video several times but I didnt understand, and at 10th time tha I was watching I asked for God take me

hey. I am a year late. Though my question is, do we set the right index to array.length or array.length-1 and what would that do to the algorithm. If someone can help me with that, it'd be great. love this channel.

I'm sorry i'm probably dumb as f but i cannot figure out for the life of me why if the last characters match then the optimal transformation from A[0;i] to B[0;j] has the same number of steps as the transformation from A[0;i-1] to B[0;j-1]. Like formally why must that be true ? I understand even less when the last characters aren't the same

from 4, in order to reach 6, why the number of ways not 2, i.e. (4+2) and (4+1+1)??

Your explanation is very confusing. Ive seen much better examples

which is the time complexity of the following sequence? and why? int n, i, j, k, s=0; cin>>n; for(i=1; i<=n*n; i++) { for(j=1; j<=i/2; j++) s+=i+j; k=1; while(k<j) { s+=k; k*=2; } } cout<<s;