Problem: LongestPalindromeString
Problem Description: Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.

O(n^2) complexity solution , also can be done using dynamic programming