The ultimate recursion guide! Master basics, solve real-world problems, and get interview-ready in hours with FAANG engineers’ proven strategies.

If you’ve ever struggled with solving coding problems using recursion, or if you need to brush up your recursion skills for an interview, this course is for you! We will start with the basics of recursion before we practice solving actual coding problems. 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 of recursion to solve complex, real-world problems. We hope that this course will help you ace all the recursion related questions during interviews at top tech companies!

Recursion for Coding Interviews in Python

def isPalindrome(testVariable) :
  # Base Case
  if len(testVariable) <= 1 : # Strings that have length 1 or 0 are palindrome
      return True

  # Recursive Case
  length = len(testVariable)
  if testVariable[0] == testVariable[length - 1] : # compare the first and last elements
      return isPalindrome(testVariable[1: length - 1])

  return False

# Driver Code
print(isPalindrome("madam"))

## Explanation

Our **base case** is the condition when we have a string of size $1$. In this case, we directly return `True`.

For the recursive case, we compare the first and last elements. If they are same, we call the function `isPalindrome()` for the string again, but with the first and last elements removed.

The illustration below demonstrates how we reached our algorithm:

This review provides a detailed analysis of the solution to check whether or not a string is a palindrome.

Recursion Fundamentals

Iteration Vs. Recursion

Recursion with Numbers

Recursion with Strings

Recursion with Arrays

Recursion with Data Structures

Conclusion

Solution Review: Check for a Palindrome

Solution: Using Recursion