Write a Java program to find longest Palindromic Substring within a string CopySample Output:The given string is: thequickbrownfoxxofnworbquicktheThe longest palindrome substring in the given string is; brownfoxxofnworbThe length of the palindromic substring is: 16

Here is a Java program that finds the longest palindromic substring within a string:

public class Main {
    static void printSubStr(String str, int low, int high) {
        System.out.println(str.substring(low, high + 1));
    }

    static int longestPalSubstr(String str) {
        int n = str.length();
        boolean table[][] = new boolean[n][n];
        int maxLength = 1;
        for (int i = 0; i < n; ++i)
            table[i][i] = true;

        int start = 0;
        for (int i = 0; i < n - 1; ++i) {
            if (str.charAt(i) == str.charAt(i + 1)) {
                table[i][i + 1] = true;
                start = i;
                maxLength = 2;
            }
        }

        for (int k = 3; k <= n; ++k) {
            for (int i = 0; i < n - k + 1; ++i) {
                int j = i + k - 1;
                if (table[i + 1][j - 1] && str.charAt(i) == str.charAt(j)) {
                    table[i][j] = true;
                    if (k > maxLength) {
                        start = i;
                        maxLength = k;
                    }
                }
            }
        }
        System.out.print("The longest palindrome substring in the given string is; ");
        printSubStr(str,

Here is a Java program that finds the longest palindromic substring within a string:

public class Main {
    static void printSubStr(String str, int low, int high) {
        System.out.println(str.substring(low, high + 1));
    }

    static int longestPalSubstr(String str) {
        int n = str.length();
        boolean table[][] = new boolean[n][n];
        int maxLength = 1;
        for (int i = 0; i < n; ++i)
            table[i][i] = true;

        int start = 0;
        for (int i = 0; i < n - 1; ++i) {
            if (str.charAt(i) == str.charAt(i + 1)) {
                table[i][i + 1] = true;
                start = i;
                maxLength = 2;
            }
        }

        for (int k = 3; k <= n; ++k) {
            for (int i = 0; i < n - k + 1; ++i) {
                int j = i + k - 1;
                if (table[i + 1][j - 1] && str.charAt(i) == str.charAt(j)) {
                    table[i][j] = true;
                    if (k > maxLength) {
                        start = i;
                        maxLength = k;
                    }
                }
            }
        }
        System.out.print("The longest palindrome substring in the given string is; ");
        printSubStr(str, start, start + maxLength - 1);
        return maxLength;
    }

    public static void main(String[] args) {
        String str = "thequickbrownfoxxofnworbquickthe";
        System.out.println("The given string is: " + str);
        System.out.println("The length of the palindromic substring is: " + longestPalSubstr(str));
    }
}

This program uses dynamic programming to check all possible substrings of a given string. It starts by checking all substrings of length 1 and 2, then it checks substrings of length 3 and so on. If a substring is a palindrome, it checks if it's longer than the current longest palindrome substring. If it is, it updates the start position and the length of the longest palindrome substring. Finally, it prints out the longest palindrome substring and its length.