Determining if a string is a palindrome—or becomes a palindrome by dropping one of its characters

palindromes.js

function isArrayPalindrome (array) {
    const forward = [...array].join();
    const reversed = [...array].reverse().join();
    if (reversed == forward) {
        return true;
    }
    return false;
}

const getArraySansIndex = (a, _index) => a.filter((item, index) => index !== _index);

function doesStringContainPalindrome (string) {
  const array = string.split('');

  if (isArrayPalindrome(array)) {
    return true;
  }

  let countBound = array.length;
  let currentIndex = 0;

  while (currentIndex < countBound) {
    const arraySansIndex = getArraySansIndex(array, currentIndex);

    if (isArrayPalindrome(arraySansIndex)) {
      return true;
    }
    
    currentIndex++;
  }

  return false;
}

function determineIfStringsContainPalindromes() {
    const stringsToCheckForPalindromes = [
        'racecar', // 0
        'rbacecar',
        'rbacecar',
        'racecarb',
        'abaaaa',
        'racecae', // 5: first indexed string that cannot be turned into a palindrome by dropping a letter
    ];    
    const results = stringsToCheckForPalindromes.map(doesStringContainPalindrome);
    
    const indexOfFalse = results.indexOf(false);
    console.log(indexOfFalse === 5);
}

// Goal is to have each of the logs print `true`
determineIfStringsContainPalindromes();

sans-solution.js

function isArrayPalindrome (array) {
    const forward = [...array].join();
    const reversed = [...array].reverse().join();
    if (reversed == forward) {
        return true;
    }
    return false;
}

function doesStringContainPalindrome (string) {
    const array = Array.from(string);
    
    if (isArrayPalindrome(array)) {
        return true;
    }
}

function determineIfStringsContainPalindromes() {
    let result;
    result = doesStringContainPalindrome('racecar');
    console.log(result === true);
    result = doesStringContainPalindrome('rbacecar');
    console.log(result === true);
    result = doesStringContainPalindrome('racecarb');
    console.log(result === true);
    result = doesStringContainPalindrome('abaaaa');
    console.log(result === true);
    result = doesStringContainPalindrome('racecae');
    console.log(result === false);
}

// Goal is to have each of the logs print `true`
determineIfStringsContainPalindromes();

Of course, any string w/ 2 or more of the same character could technically be said to contain the possibility of a palindrome. That is why, in this case, "possibility of a palindrome" is defined as "a string in which removing 0-1 characters from any index will result in a string that contains the same character sequence whether read from the left end or right end of said string"