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

# Explanation
The solution to this problem is similar to the solution of finding the [length of a string](https://www.educative.io/courses/recursion-for-coding-interviews-in-javascript/solution-review-length-of-a-string).

For this problem, we remove the first element of the string and call another instance of the same function. The first element of the string is converted to an integer. When the child function returns its value, this converted integer is added to the result.

> The **base case** remains the same, like the previous problem, meaning that the string returns $0$ if it is *empty*. 

Let's take a look at the illustration of this problem:

This review provides a detailed analysis of the solution to find the sum of digits in a string.

Recursion Fundamentals

Iteration Vs Recursion

Recursion with Numbers

Recursion with Strings

Recursion with Arrays

Recursion with Data Structures

Conclusion

Solution Review: Sum of Digits in a String

Solution: