I've been searching for quality DSA lectures on TH-cam, and I'm delighted to have found excellent your channel. I'm eager to watch your videos and deepen my understanding of DSA. Thank you for clear and quality video.
Thank you so much Niteen for being a member and supporting my channel. It really motivates me to keep working hard and bringing out the best. Remember that as a member, you do get priority reply to comments and queries. :)
I am new to dynamic programming! Good video! Keep making such videos. Although i did not understand it completely, I got a new idea on how to work on problems rather than going straight to brute force methods! Thanks
19:59 In the first condition both a are equal at i=1 and j=1 so the string index starts from 0 the first character in word1 is a at index 0 so we need to reduce the i and j by minus 1 Hope you understand
I went through lot of solution videos. Yours is so easy to understand . Keep up the great work :)
I've been searching for quality DSA lectures on TH-cam, and I'm delighted to have found excellent your channel.
I'm eager to watch your videos and deepen my understanding of DSA.
Thank you for clear and quality video.
Thank you so much Niteen for being a member and supporting my channel. It really motivates me to keep working hard and bringing out the best. Remember that as a member, you do get priority reply to comments and queries. :)
wowwww. Finallyyyy. I have understood this! Thanks a million!
Thank you very much! The information provided was easy to comprehend.
Amazing explanation 🙌
Great explanation, Thanks!
nikil, thank you so much my brother , a big fan from algeria
happy to have you
Thank you bhaiya you are explain very well like striver ।। Are you preparing for any company..
Absolutely perfect
I am new to dynamic programming! Good video! Keep making such videos. Although i did not understand it completely, I got a new idea on how to work on problems rather than going straight to brute force methods! Thanks
What part did you face a problem with?? I can help
How do you know, you have to attack this problem in this way at the first glance?
The more you practice, the more patterns you will start to observe. No shortcut my friend :)
u explained xactly how its to be done
not just filling table
Can you please make video on word break and equal sum partition problem
Those are in my list.
Thank you!!!!!! Love your Teaching style
What is the complexity of this solution?
Is it O(n) + O(n) + O(n^2)?
I explain it at 20:56
can you tell me that while initialization of matrix, why are we traversing from the 1st index and not 0?
the first row and column will all be zeroes
why did we compare string at i-1 and j-1 ??
To check whether they are same characters or not?
19:59 In the first condition both a are equal at i=1 and j=1 so the string index starts from 0 the first character in word1 is a at index 0 so we need to reduce the i and j by minus 1
Hope you understand
Can someone let me know why do we initialize dp with length (m+1, n+1), why we have to consider empty char at begging of the appraoch?
Because empty character is also a valid test case
If you have an input like this
str1 = “abcd”
str2 = “”
This is a perfectly valid test case and it’s answer will be 4.
@@nikoo28o
Lucid !
It was great ! Thanks !
waiting for more videos on strings