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 a Graph?
Graphs represent pairwise relationships between objects. Graphs are `mathematical structures` and therefore can be visualized by using two basic components, `nodes` and `edges`

A node, also known as a vertex, is a fundamental part of a graph. It is the entity that has a name, known as the `key`, and other information related to that entity. A relationship between nodes is expressed using edges. An edge between two nodes expresses a one-way or two-way relationship between the nodes.

Graphs can be represented as **Adjacency Matrix** or **Adjacency List**. We will be using adjacency list representation for this course. If you want to study graphs in detail, review [Interview Refresher Course on Data Structures in Python](https://www.educative.io/courses/data-structures-coding-interviews-python/what-is-a-graph).

The diagram below shows an example graph. It had $6$ nodes and $6$ edges.

In this lesson, we will learn about depth first traversal of graph using recursion.

Recursion Fundamentals

Iteration Vs. Recursion

Recursion with Numbers

Recursion with Strings

Recursion with Arrays

Recursion with Data Structures

Conclusion

Depth First Traversal of Graph

What is a Graph?