private boolean[][] getIsPalindrome(String s) {
        boolean[][] m = new boolean[s.length()][s.length()];
        for (int i = 0; i < s.length(); i++) {
            m[i][i] = true;
            if (i < s.length() - 1) {
                m[i][i+1] = ( s.charAt(i) == s.charAt(i+1) );
            }
        }
        for (int len = 3; len <= s.length(); len++) {
            for (int i = 0; i <= (s.length() - len); i++) {
                m[i][i + len - 1] = (s.charAt(i) == s.charAt(i+len-1)) && (m[i+1][i+len-2]);
            }
        }
        return m;
    }