public class StringPalindrome {
    public static void main(String[] args) {
        recursiveSolve("ddabccba");
    }

    public static void recursiveSolve(String input) {
        System.out.println(recursiveSolve(input, 0, input.length() - 1));
    }

    public static int recursiveSolve(String input, int start, int end) {
        if (start == end) return 0;
        if (start > end) return Integer.MAX_VALUE;
        if (start == end - 1) return input.charAt(start) == input.charAt(end) ? 1 : 0;

        return input.charAt(start) == input.charAt(end) ?
                recursiveSolve(input, start + 1, end - 1) :
                Math.min(recursiveSolve(input, start + 1, end), recursiveSolve(input, start, end - 1)) + 1;
    }
}