Does this include memoization

life saver

ben is genius

what is this guy talking about

🫡

Great videos; thanks - looked at this and the knapsack problem. I think going a bit too fast bro but great explanations for sure... I'm finding it very difficult to identify with the why's. Seems I'm not getting the reasons behind what's happening yet. Are the coins sorted in this case? Why do we deduct the value of the coin to consider it when we are? These are not just the only questions I have; it seems I'm still not getting it; not sure if it's normal to be struggling with these - are these understandably difficult? +1 subscriber for the good explanations! Thanks so much!

I realized today that I was pretty dumb

please can anyone refer to me the top down solution of the same problem ??!!! HELP

why dont you before starting always remind people that the position of n is the index and it starts at 0 always, so we do i+1? i feel like a constant reminder would help. or maybe everyone knows this and I'm new so I need this but everyone else already ahead of me :D

Best video on this subject! Thank you!

Thank you so much for this video, I've been struggling to understand this for awhile.. Buh now I get it..

Thank you so much for your efforts and explanation. I finally feel like I understand what a log is, and it is soooo COOL!!!

Is it backtracking or simply a recursion? After each sub-problem we are guaranteed that this is the current optimal solution, it's a tail recursion. There is no need to back-off and explore other possibilities at each stack.

had to pause the video to say that the way you explain this is so refreshing. I thought it was going to be hard to understand but your explanation really helped. Thank you!!!

Where is the code? Am I mistaking the place where the description is supposed to be?

Fantastic explanations

Thank you so much for this! Great video!

If you use a STACK it will be much easier, yet the same time complexity

This guy is talented

What if we never face a suffix == prefix , what is the time complexity in this case? Is KMP still preferable to Rolling-Hash ?

tnxxx

Very hard to build an intuition for this, but this video is closest I have seen.

Man, this is the clearest explanation about log(n) i've ever seem. Thank you so much

But none mentions how do e actually get the LCS string... All we got is the max length.

God, thank you so much for this video. I was pulling my hair out reviewing some modules before my upcoming final. This clarified things so much!!

That's the best explanation for any beginner to understand.

This video explains the remove so well.

哥们儿牛逼！

For sure your videos is causing a positive impact. At least, for me this channel is so valuable. Great job man!

You're the only one who properly explained why we take the max value. Great intuition

Been watching many tutorial resource these days. This is the best video. Wish I've seen this in the beginning and saved a lot of my time watching others.

Fantastic video. Beautiful work.

Thanks for the awesome explanation!

really helpful thank you

Wonderful video and very verbose explanations. I can't believe you actually worked through each of the cases for the bottom-up approach. Most people would've done the first few and said "and so on" and filled up the remainder of the table. Thank you for the video.

Thank you.

In english, LR and RL rotations are so intuitive! In Portuguese, I'm struggling to get what the heck a "double left" rotation looks like...

Jesus christ, that crossover in the second minute... hehe

Got uuuuuuuuuuuu

I didn't see any video like your's explaining tabulation in the easiest way .

Wonderful explanation

I finally found explanation I am looking for. You actually explain why we take max(dp[i-1[]j], dp[i][j-1]) and 1+dp[i-1][j-1]. Every one was telling that just follow the instruction you will find the ans.

I don't know how to thank you. You have saved me hours of reading a Data Structures Textbook 3 times just to get this concept. Very thankful. Please do not stop your great work

Couldn’t you do it in m+n space instead of mxn? Just keep the last row and column u calculated and forget the rest

Could you do a video on the Convex Hull Algorithm?

Slow down Sir

Holy shit, now it f*@@ing makes sense, it's just an object with a pointer... Thank you so much Sir

I don't where you are these days, when I was fresher I learnt from your videos. Now I have experience of 3 years and I am still learning from you. Am I in love with you ? 😜

Thank you so SO much!

Can you plz suggest a good text book for this....I was using Douglas West....what's your choice