The ultimate guide to recursion interviews in JavaScript. Developed by FAANG engineers. Practice with real-world interview questions and get interview-ready in just a few hours.

If you’ve ever struggled with solving problems using recursion, or if you have to brush up your skills for an interview, this course is for you.

We'll start with the basics of what recursion is and why it’s important before diving into practicing solving actual questions. You’ll have access to detailed explanations and visualizations for each problem to help you along the way. 

By the time you have completed this course, you’ll be able to use all the concepts to solve complex real-world problems. We hope that through practicing recursion, you will be able to ace all recursion related questions in interviews at top tech companies.

Recursion for Coding Interviews in JavaScript

## Problem Statement
Write a function that takes a variable `testVariable`, which contains a string, and checks whether or not it is a palindrome.

### What is a "Palindrome"?
A **Palindrome** is a string that reads the same backward and forwards. For example $madam$, $pop$, etc. All strings with length $1$ are considered palindromes.

> Remember, lower case letters are different from upper case letters, therefore, $Ada$ is not a palindrome.

### Input
A variable `testVariable` containing a string.

### Output
`true` if the input string is a palindrome. `false` if the string is not a palindrome.

### Sample Input
```javascript
"madam"
```

### Sample Output
```javascript
true
```

### Try it Yourself
Try this challenge yourself before examining the solution. Good luck!

# Problem Statement
Write a function that takes a variable `testVariable`, which contains a string, and checks whether or not it is a palindrome.

## What is a "Palindrome"?
A **Palindrome** is a string that reads the same backward and forwards. For example $madam$, $pop$, etc. All strings with length $1$ are considered palindromes.

> Remember, lower case letters are different from upper case letters, therefore, $Ada$ is not a palindrome.

## Input
A variable `testVariable` containing a string.

## Output
`true` if the input string is a palindrome. `false` if the string is not a palindrome.

## Sample Input
```javascript
"madam"
```

## Sample Output
```javascript
true
```

## Try it Yourself
Try this challenge yourself before examining the solution. Good luck!

Given a string, check whether or not it is a palindrome.

Recursion Fundamentals

Iteration Vs Recursion

Recursion with Numbers

Recursion with Strings

Recursion with Arrays

Recursion with Data Structures

Conclusion

Challenge 3: Check Palindrome

Problem Statement

What is a “Palindrome”?