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.

Solving Problems with Recursion in Python

A function that calls another execution instance of the same function.

A class method that calls another class method.

An in-built method that is automatically called.

Which is the most appropriate definition for recursion?

Which is the most appropriate definition for recursion?

Problems that can only be defined recursively can be solved using recursion.

Problems that can only be defined recursively can be solved using recursion.

Every recursive function must have a base case.

Infinite recursion can occur if the base case is not properly defined.

A recursive function makes the code easier to understand.

Every recursive function must have a return value.

Which of the following statement is false?

Which of the following statement is false?

Recursion and iteration are the same programming approach.

Recursion and iteration are the same programming approach.

Fill in the missing line:
```python
def fact(num) :
    if num == 0 : 
        return 1
    else:
        return _________
```

Fill in the missing line:
<pre><code class="language-python">def fact(num) :
 if num == 0 : 
 return 1
 else:
 return _________
</code></pre>

Recursion is the process of describing an action in terms of itself.

Recursion is the process of describing an action in terms of itself.

A recursive function may or may not have a recursive case.

A recursive function may or may not have a recursive case.

Stacks in computing architectures are regions of memory where data is added or removed in a last-in-first-out (LIFO) manner. 

Stacks in computing architectures are regions of memory where data is added or removed in a last-in-first-out (LIFO) manner.

A factorial is the product of an integer and all the positive integers greater than it.

A factorial is the product of an integer and all the positive integers greater than it.

In Mutual Recursion, the calling function calls another instance of itself directly.

In Mutual Recursion, the calling function calls another instance of itself directly.

This Quiz will take maximum 10 minutes.

This Quiz will take maximum 10 minutes.

---
In the next lesson, we will introduce iterative method of problem solving.

Recursion Fundamentals

Iteration Vs. Recursion

Recursion with Numbers

Recursion with Strings

Recursion with Arrays

Recursion with Data Structures

Conclusion

Test Your Knowledge 1

Quiz on Recursion Fundamentals