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

## Direct Recursion

Direct recursion occurs when a function calls itself.

This results in a **one-step** recursive call, meaning that the function makes a recursive call inside its own function body.

### Syntax of Direct Recursion
```python
def function1(p1, p2, ..., pn) :
  # Some code here
  function1(p1, p2, ..., pn)
  # Some code here
```

### Printing Natural Numbers from $1$ to $n$ Using Direct Recursion

Let's take a look at an example of a function that prints natural numbers from $1$ to $n$:



# Direct Recursion

Direct recursion occurs when a function calls itself.

This results in a **one-step** recursive call, meaning that the function makes a recursive call inside its own function body.

## Syntax of Direct Recursion
```python
def function1(p1, p2, ..., pn) :
  # Some code here
  function1(p1, p2, ..., pn)
  # Some code here
```

## Printing Natural Numbers from $1$ to $n$ Using Direct Recursion

Let's take a look at an example of a function that prints natural numbers from $1$ to $n$:



This lesson goes over two different types of recursion: direct and indirect recursion.

Recursion Fundamentals

Iteration Vs. Recursion

Recursion with Numbers

Recursion with Strings

Recursion with Arrays

Recursion with Data Structures

Conclusion

Direct Vs. Indirect Recursion

Direct Recursion

Syntax of Direct Recursion

Printing Natural Numbers from $1$ to $n$ Using Direct Recursion