Search⌘ K
AI Features
Home
Courses
Recursion for Coding Interviews in JavaScript

Solution Review: Check Palindrome

Explore how to implement a recursive function to verify palindromes in strings. Understand the base case for string length and the recursive comparison of characters to develop effective recursive solutions in JavaScript.

We'll cover the following...

Solution: Using Recursion

Javascript (babel-node)
function isPalindrome(testVariable) {
  // Base case
  if (testVariable.length <= 1) { // Strings that have length 1 or 0 are palindrome
      return true;
  }
  // Recursive case
  else if (testVariable[0] == testVariable[testVariable.length - 1]) { // compare the first and last elements
      return isPalindrome(testVariable.substring(1, testVariable.length - 1));
  }
  return false;
}
// Driver Code
console.log(isPalindrome("madam"));

Explanation

Our base case (line number 3 to 5), is the condition when we have a string of size less than or equal to ...