Java O(n) recursion

public class Solution {
    public int solve(String str) {
        return isOneCharAwayFromPal(str, 0, str.length()-1, 0)?1:0;
    }
    public boolean isOneCharAwayFromPal(String str, int i, int j, int count){
        if(count > 1)
            return false;
        if(i>=j)
            return true;
        return str.charAt(i) == str.charAt(j)?
                isOneCharAwayFromPal(str, i+1, j-1, count):
                isOneCharAwayFromPal(str, i+1, j, count+1) ||
                isOneCharAwayFromPal(str, i, j-1, count+1);
                
    }
}
  return str.charAt(i) == str.charAt(j)?
            isOneCharAwayFromPal(str, i+1, j-1, count):
            isOneCharAwayFromPal(str, i+1, j, count+1) ||
            isOneCharAwayFromPal(str, i, j-1, count+1);

Can you please write these line in simple way?

Click here to start solving coding interview questions