Great keerti, it's so fulfilling to see real corporate people joining the RUclips and sharing the knowledge, I too am a HR professional and have started a dedicated channel to help people be successful in their career.. I wish you the best dear...
Thank you @Code Ninja. It was an honest mistake. I missed checking the first case. I considered putting down the video since youtube doesn't allow you to edit once the video is up but since explanation was right and the mistake is only at very end - I am adding this to description. Thanks again for pointing it out! Hope this never happens again!
@@KeertiPurswani Thanks for responding in. The intent was only to help share honest feedback as this would benefit other folks learning in as well. These are amazing videos. Keep doing the good stuff! All the best ahead.
Wow..Wow... I have never seen anyone explains DP this clearly, I have seen many other videos but they all say take value from previous, above or diagonal cell, but nobody explained why we need to refer different cells. you are the only one who explains the usage of the previous cells.. you never miss to impress Keerti. I am going to save this video for my DP reference. Keep going
Is it necessary to learn recursion, if without knowing recursion, can we directly jump into tabulation in dp?. If all subproblems can be solved using dp, should we need to go for recursion( except tree and graph traversals)?
The one line which you use in your videos, "I know it's not easy to understand it now.... once we take an example it will be much more clear" always encourages me to stick to it and it feels as if you know the state of your student/viewer at that point, hats off to your teaching method Keerti and thank you very much!
Great explanation.. before coming to this video, I saw some other videos as well.. Only your video had the complete explanation for each step. Thank you so much!
Why do you need this matrix .. just create two array for storing the char count. Check how many add and delete operation are there. Take the maximum of two, because one delete and one add operation is basically a replace operation .. this should be the easiest explanation. 20 mins for this?
Great keerti, it's so fulfilling to see real corporate people joining the RUclips and sharing the knowledge, I too am a HR professional and have started a dedicated channel to help people be successful in their career.. I wish you the best dear...
In m[5][4], n == n, m[5][4] should be set to m[5-1][4-1] = 2 instead of 3 as shown. The overall answer will hence be 3 instead of 4. Please correct it
Thank you @Code Ninja. It was an honest mistake. I missed checking the first case. I considered putting down the video since youtube doesn't allow you to edit once the video is up but since explanation was right and the mistake is only at very end - I am adding this to description. Thanks again for pointing it out! Hope this never happens again!
@@KeertiPurswani Thanks for responding in. The intent was only to help share honest feedback as this would benefit other folks learning in as well. These are amazing videos. Keep doing the good stuff! All the best ahead.
Thank you so much! It really means a lot 😊☺️
For the instance where n==n shouldn’t it pick up the value from diagonal up??
Great job! Keep posting such videos!
Wow..Wow... I have never seen anyone explains DP this clearly, I have seen many other videos but they all say take value from previous, above or diagonal cell, but nobody explained why we need to refer different cells. you are the only one who explains the usage of the previous cells.. you never miss to impress Keerti. I am going to save this video for my DP reference. Keep going
it is very difficult for me to understand dp but the way you are explaining makes me to understand the concept very clearly
Is it necessary to learn recursion, if without knowing recursion, can we directly jump into tabulation in dp?. If all subproblems can be solved using dp, should we need to go for recursion( except tree and graph traversals)?
Really helped in visualizing how DP can help in solving this problem. Thanks Keerti!
the minimum operation will be 3
Yes, have added in the description 😊
Awesome content and very good in clarity of explanation. Try to reduce the background noise . i loved the content #keerthiPurswani . Cheers
nice
Mam try to use pen tab. It will more efficient than whiteboard
The patience to almost complete the dry run, hat's off to that!
Nice explanation... Helps visualizing properly... Keep it up
👍👍👍❤❤
great job
Can you explain top down approach ?
Mam i understood it preety well but i don't get it that how would i think in this way while solving.
It will come with practise. Focus on understanding the logic and thought process 😊
I love you Keerti💞💞💞
Nice explanation!
simply great
Maam, I think in the second condition at 6:10 it should be str[i-1]==str[j-1], please correct me if I understood anything wrong. Thank You
Much better audio! Good job!
Thanks :)
Great Content...
The one line which you use in your videos, "I know it's not easy to understand it now.... once we take an example it will be much more clear" always encourages me to stick to it and it feels as if you know the state of your student/viewer at that point, hats off to your teaching method Keerti and thank you very much!
Great explanation.. before coming to this video, I saw some other videos as well.. Only your video had the complete explanation for each step. Thank you so much!
Hi Keerti, in the If condition it should be str1[i - 1] == str2[j - 1]
thanks for this video. Can you please do a video to explain the coin change problem as well
CRYSTAL CLEAR! Thank you :)
Good explanation 👍
best ever explanation to this problem ✌️
Thanks Sathish 😇
Great explanation. And please make a space optimization video!
It's already there.
Check it out - ruclips.net/video/7C_FIc7PytA/видео.html
Hope you like it! 😇
@@KeertiPurswani Thank you so much didi.
Hope you like it! 😇
Why do you need this matrix .. just create two array for storing the char count. Check how many add and delete operation are there. Take the maximum of two, because one delete and one add operation is basically a replace operation .. this should be the easiest explanation. 20 mins for this?