The ultimate guide to recursion interviews with strategies developed by FAANG engineers. Practice with real-world interview questions, detailed explanations, and visualizations to prep faster.

If you’ve got an interview coming up and want to brush up on your knowledge, or if you’ve ever struggled with solving coding problems using recursion, you'll 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 by using interactive code playgrounds that 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 Java

# Problem Statement

Given a sentence you will find that the letters can be divided into two segments: **Consonants** and **Vowels**. Vowels include the letters: *A, E, I, O, U*. Consonants include all other letters in the alphabet. In this challenge, you must find the **total numbers of vowels** in a given string. 

The illustration below explains this concept.

In this lesson, you must  find the total number of vowels present in a given string.

Fundamentals of Recursion

Iteration to Recursion

Recursion with Numbers

Recursion with Strings

Recursion with Arrays

Recursion with Data Structures

Challenge 1: Let's find the total number of vowels!

Problem Statement