import java.util.*; public class Solution { public int getLongestPalindrome(String A, int n) { if (n < 2) return A.length(); int maxLen = 0; boolean[][] dp =new boolean[n][n]; for(int right =1; right<n;right ++){ for(int left =0;lef...