Longest Common Substring Dynamic Programming

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. Here you will learn about the Longest Common Substring . In this question :

1. You are given two strings S1 and S2.
2. You are required to print the length of the longest common substring of two strings.

[VKBMath]

This type of content is free unbelievable
Love you Sumeet sir what a teacher ❤️❤️❤️❤️❤️❤️

[prateeksharma]

No one gave this kind of insight of the problem, the WHY portion explained is excellent.
Thanks Sir for such a great content.

[simakeshri]

Aaj real meaning smj m aaya, baki log to bus dp bharna batate h.
👍👍.
Thank you sir for these free content

[sadmanabedin]

I solved this problem without even watching this video, using the techniques brother Sumeet taught in earlier problems like Longest palindroming substring, longest common subsequence etc.
That proves how extremely good he is at teaching these staffs.
Keep it up bro.

[samarthjain]

This video deserves a like tbh, I have seen so many videos on this question but this is the only video saying that why it is happening .Thank you

[kartikshrivastava]

When asked how some tabulation solution works very few people know what's happening inside it, you are the one who knows inside-out of it, thanks a lot for sharing!

[adevpatelsvnit]

This is the most underrated channel for programming on youtube

[sameersondur]

There are only 2 words that come to my mind!! ekdum jhakaas!!!! I had seen 3 videos till now for this problem and this is the first video I understood.

[shashwatagarwal]

This is by far the most amazing explanation to this problem. Hats off!

[abhinavagrawal]

The way he explains agar koi interview me explain kre to interviewer wahi fan ho jaye.

[Ali-okyn]

Best explanation for this question on the internet. DP solutions are always easy but the important part is how you reached that solution and you have explained that really well.

[rishabhkumar]

i really impressed by your explanation.
thanks man for this.

[helloword]

This question can be done in other way also, i.e, we can also evaluate longest common substring by comparing all suffixes of s1 with all suffixes of s2 and find the longest common prefix .

[imajt]

Dil se thank you bhai for providing the best content and giving so much time and effort to help us.

[indranilchakraborty]

nice explanation akdm clear ho gya.😊😊😊😊

[democrats]

Woah❤

isse kehte h explaination🙌, this was amazing!

[gaunikasrivastava]

This explanation really gave a feel of the solution. Even better than AV's video

[amandixit]

ok, whosoever understood this question try thinking out can we do like we are going to store in each cell i, j the LCS between s1(0, i) and s2(0, j). If you figured out the way doing so, good and if not, why not . comment down below. This will make the understanding of this question crystal clear in your mind. #HAPPYCODING.

[pranjalsharma]

Sir you are doing a very good job, keep going

[simrankak]

sir your explaination is so very good thankyou :)