int[] pal(char[] a, int i, int j) {

        while (i >= 0 && j < a.length) {
            if (a[i] != a[j]) {
                return new int[] { i + 1, j };
            }
            i--;
            j++;
        }
        return new int[] { i + 1, j };
    }
Why Did you create this class? what does it do?
src/problems/medium/LongestPalindromicSubstring.java