exercise25.md

Exercise

Write a function that checks if a string is palindrome recursively.

A palindrome is a word is a word which reads the same backward as forward, such as madam or racecar.

Solution

function isPalindrome(word) {
  if (word.length === 0) return true;
  if (word.length === 1) return true;
  return (
    word[0] === word[word.length - 1] &&
    isPalindrome(word.slice(1, word.length - 1))
  );
}

console.assert(isPalindrome('madam'), "Wrong implementation");
console.assert(isPalindrome('racecar'), "Wrong implementation");
console.assert(!isPalindrome('whatever'), "Wrong implementation");