DP

by Krishna Ananthi

JavaScript

var longestPalindrome = function(s) {
    let res= '', resLen = 0;
    const findPalindrome = (l,r) => {
        while(l>=0 && r<s.length && s[l]===s[r]){
            if(r-l+1 > resLen){
                resLen = r-l+1;
                res = s.slice(l,r+1);
            }
            l--;
            r++;
        }
    }
    for(let i=0;i<s.length;i++){
        findPalindrome(i,i)
        findPalindrome(i,i+1)
    }
    return res;
};
console.log(longestPalindrome('abcbbcb'));