Given a string S of length N, find the longest palindromic substring in S. Substring of string S: S[ i . . . . j ] where 0 ≤ i ≤ j < len(S). Palindrome string: A string which reads the same backwards.
if(s1[i-1] == s2[j-1]) return 1 + f(i-1,j-1, s1, s2); return max(f(i-1,j, s1, s2), f(i,j-1, s1, s2)); if(dp[i][j] != 0) return dp[i][j]; if(s1[i-1] == s2[j-1]) return ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results