Maximum Length of Repeated Subarray (LeetCode 718) | Longest Common Substring | Simplified

[@shivraj940]

Awesome bro, Clear explanation.

[@nikoo28]

Glad you liked it

[@BRBallin1]

Great explanation. Very easy to follow along

[@MrEastgalaxy]

Love the channel!🎉🎉

[@nikoo28]

Yay! Thank you!

[@nexonsensei3793]

Really great explanation, I understood it very clearly❤

[@MahedeeHasan]

Great explanation. I like your video very much.

[@АртемПотешкин-к6о]

Thank you very match, you have a so clear diction and explanation!

[@nikoo28]

You are welcome!

[@hrushirajg9991]

Nice explanation

[@subee128]

Thanks

[@Praasanthkahe]

what about , choosing the greatest value among the values above and before if the values of the array are different , if equal we can add one with the diagonal value ; where we can just return the dp[m][n]

[@nikoo28]

Can you provide a pseudo code so I can verify

[@srivyshnavi6271]

how to get that memozation logic?? like how will I know the rules of filling the table and analysing the answer??

[@nikoo28]

how do you understand any logic?? just by sheer practice...once you solve more problems, you will start seeing patterns.

[@dineshkm7832]

you have not given how to find the longest comment array like 1 2 and 3 in this case ..