Problem - Find maximal palindromic subsequence/substring of given string.

Following is one of the solution. But it is not efficient one.
It takes O(n²) for both time and space.