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

# What is the modulo operation?

The modulo operation (abbreviated as **mod**) returns the **remainder** when a number is divided by another number. The symbol for `mod` is `%`.

> The number being divided is called the **dividend**. The number that divides the dividend is called the **divisor**.

The illustration below represents the concept of remainders using basic division example: 


In this lesson, we will learn about the modulo operation and how to implement it using recursion.

Recursion Fundamentals

Iteration Vs. Recursion

Recursion with Numbers

Recursion with Strings

Recursion with Arrays

Recursion with Data Structures

Conclusion

Modulus

What is the modulo operation?