Longest Common Substring Using Dynamic Programming Tabulation

preview_player
Показать описание
If you find this video helpful, please 'Like' or 'Subscribe'.
This is really helpful for the channel and also motivates me to do more of such good videos.

Longest Common Substring Using Dynamic Programming - Tabulation.

We will populate the DP table bottom up to find the Longest Common Substring in two strings.

M : Length of first string
N : Length of second string

Time and space complexity is O(M*N) as we are visiting each character of both strings and forming DP array which is M*N.

#coding #softwareengineer #Leetcode #Algorithm #DataStructure #Java #programmer #tech #software #codinglife #Preparation
#interview #programminglife #programmingisfun #dynamicprogramming
Рекомендации по теме