markckim

// problem: find the longest palindrome substring within a string s 
// e.g., if s = "bananas", the longest palindrome substring is "anana"
//
// dynammic solution:
//
// recursion (in words):
// l[i,j] = longest palindrome substring in string s created starting at index i and ending at index j in string s
// l[i,j] could be an empty string if a palindrome is not possible starting at index i and ending at index j
//