Master recursion in C++ to tackle coding problems and excel in tech interviews with practical exercises and visual aids.

If you’ve ever struggled with solving coding problems using recursion, or if you’ve just got an interview coming up and want to brush up on your knowledge, you’ll definitely find this course helpful.
 
You’ll start with the basics of what recursion is and why it’s important before diving into what it looks like in practice. You’ll see how recursion can help you solve a variety of different math, string, and data structure problems, using interactive code playgrounds you can execute directly in your browser. You’ll have access to detailed explanations and visualizations for each problem to help you along the way.  
 
By the time you’re done, you’ll be able to use what you’ve learned to solve complex real-world problems, and even advance more easily through your interviews at top tech companies.

Recursion for Coding Interviews in C++

## What is Depth First Search?

**Depth First Search** is a way to traverse and search all nodes in a graph. This traversal algorithm works in such a way that it starts from the **root node** and then traverses all the way down that **branch** until it reaches the **leaf**, i.e., the last node with no other children, and then **backtracks**. This follows until all nodes are traversed. The illustration below shows a better understanding of `DFS`. 

# What is Depth First Search?

**Depth First Search** is a way to traverse and search all nodes in a graph. This traversal algorithm works in such a way that it starts from the **root node** and then traverses all the way down that **branch** until it reaches the **leaf**, i.e., the last node with no other children, and then **backtracks**. This follows until all nodes are traversed. The illustration below shows a better understanding of `DFS`. 

This lesson will teach you how to write a recursive code for depth first search in graphs.

Recursion Fundamentals

Recursion with Numbers

Recursion With Strings

Recursion With Arrays

Recursion with Data Structures

Depth First Search in Graphs

What is Depth First Search?