check palindromes with some tolerance indicated by totalCharsToCheck

Main.java

package br.com.soeirosantos;

import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;

public class Main {

	public static void main(String[] args) {
		System.out.println(isAlmostPalindrome("abcddcba", 0));
		System.out.println(!isAlmostPalindrome("abcddcbx", 0));
		System.out.println(isAlmostPalindrome("abcddcbx", 1));
		System.out.println(!isAlmostPalindrome("abcdycbx", 1));
		System.out.println(isAlmostPalindrome("abcdycbx", 2));
		System.out.println(!isAlmostPalindrome("abcdydbx", 2));
	}

	public static boolean isAlmostPalindrome(String word, int totalCharsToCheck) {
		char[] chars = word.toCharArray();
		Queue<Character> queue = new LinkedList<>();
		Stack<Character> stack = new Stack<>();
		for(char c : chars) {
			stack.push(c);
			queue.offer(c);
		}
		boolean isPalindrome = true;
		int totalDiff = 0;
		for (int i = 0; i < chars.length/2; i++) {
			char c1 = stack.pop();
			char c2 = queue.poll();
			if (c1 != c2) {
				totalDiff++;
				if (totalDiff > totalCharsToCheck) {
					isPalindrome = false;
					break;
				}
			} 
		}
		return isPalindrome;
	}
}