Palíndromo recursivo mais elegante do universo em javascript

gistfile1.js

function palindrome (word){
  var len = word.length,
      lastCharIndex = len - 1;

    if (len === 0 || len === 1) {
      return true;
    }

    if (word[0] === word[lastCharIndex]) {
      word = word.substr(0, lastCharIndex).substr(1);
      return palindrome(word);
    }
    
    return false;
}

outra maneira
function checkPalindrome(word) {
return word == word.split('').reverse().join('');
};