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

preview_player
Показать описание

Chapters:
00:00 - Intro
00:39 - Problem Statement
02:09 - Conversion to Longest Common Substring
04:14 - Quick Review of solution
08:15 - Dry-run of Code
12:12 - Final Thoughts

📚 Links to topics I talk about in the video:

📖 Reference Books:

🎥 My Recording Gear:

💻 Get Social 💻

#leetcode #programming #interview
Рекомендации по теме
Комментарии
Автор

Great explanation. Very easy to follow along

BRBallin
Автор

Really great explanation, I understood it very clearly❤

nexonsensei
Автор

Great explanation. I like your video very much.

MahedeeHasan
Автор

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

АртемПотешкин-ко
Автор

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]

Praasanthkahe
Автор

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

srivyshnavi
Автор

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

dineshkm