hello there, I tried to solve aproblemwhich is directly based on the Longest common substring. I solved it quite easily with thebottom-up(DP) approach because it seemed more intuitive to me thentop-downsince I just needed to extend to the idea of Lcs(longest common subsequence). ...
[006] largest_common_substring [Description]Given two different strings, find the largest successive common substring. e.g. str1[]="qwertyuiopasdfgh"; str2[]="jhdfgqwertyudfxcv"; LCsubstr[]="qwertyu"; [Thought]show the correspondence result of this two strings from the 2-D array of 're...
hello there, I tried to solve aproblemwhich is directly based on the Longest common substring. I solved it quite easily with thebottom-up(DP) approach because it seemed more intuitive to me thentop-downsince I just needed to extend to the idea of Lcs(longest common subsequence). below, h...
hello there, I tried to solve aproblemwhich is directly based on the Longest common substring. I solved it quite easily with thebottom-up(DP) approach because it seemed more intuitive to me thentop-downsince I just needed to extend to the idea of Lcs(longest common subsequence). below, h...