Longest common substring | Dynamic programming

This video explains how to find the longest common substring as well as print the longest common substring. This is a very popular dynamic programming video which is frequently asked in programming interviews. The code for it is present below. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

[gourabbanerjee]

I believe I have gone through all the famous youtube channels explaining DSA. And I must say, the best explanation for each problem I find here. While I search for any problem, I have started looking whether TECH DOSE made any video on that or not, if yes, then I ignored all other channels blindly and I never disappointed. Thank you so much!!

[lakhwindersingh-quwj]

thank you tech dose. Finally someone explained this throughly

[AtulKumarVermaOnline]

Most Youtubers just teach how it works and just go through the algorithm. Thank you for also teaching why it works and how to think about it.

[Bhubhu]

Nothing can be better than this, you really wanted to make things clear, simply awesome man.
Thank You and keep up the good work.

[mariocraft]

Was able to use this algorithm to finish a spell checker assignment. Could not have done it near as well without this video!

[ashishm]

Dude, you have my respect, and my thanks! 🙏

[atharvakulkarni]

Honestly, for beginners bottom up DP is not at all intuitive and your majority audience is beginner to medium level guys, so please try to explain DP problems using Top Down approach as well. BTW Very nice explanation. Thanks!

[EngWorld-nrww]

Nice and precise explanation than other available on youtube

[damaroro]

YOUR VIDEO HELPS ME A LOT, THANKS SENSEI

[pavankumar.m]

Now i understood the logic of this dynamic programming

[prasad.patil]

Such a detailed and clear explanation 👍

[shagunlamba]

great explanation, recommending to everyone.

[geniusboys]

great explanation ! Thank you finally I understood

[atefnazi]

very well explained...want more DP solutions from you

[shams_vai_]

what is the difference between longest common subsequence and longest common substring?

[adityagoswami]

Can you explain after getting the all diagonal number in dp table, how to print the lcs strings

[PrateekJesingh]

Good explanation of the dynamic programming bit but what was lacking was the intuition behind how you filled the table, please include that as well. You wouldn't expect anyone to just memorise the solution

[adityapandey]

What will be the recursive approach of this Q?? We can't return 0 if it's character is not matching!

[sauravgsh]

Great explanation. Can you also provide a space optimized solution for the same ?

[shubhamjaiswal]

explanation was good ...but what about memoization and recursion .... rather it would give TLE i know but you should firstly tell that