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

What is the output of the following code?
```Java
public static int pow(int b, int p)
{
    if (p == 0)
    {
       return 1;
    }
    else
    {
         return (b*pow(b, p-1));
    }
}

public static void main(String args[])
{
			System.out.print(pow(2,5));
}
```

What is the output of the following code?
<pre><code class="language-Java">public static int pow(int b, int p)
{
 if (p == 0)
 {
 return 1;
 }
 else
 {
 return (b*pow(b, p-1));
 }
}

public static void main(String args[])
{
			System.out.print(pow(2,5));
}
</code></pre>

What is the output of the following code?
```Java 
public static int foo(int n)
{
    if (n == 12)
    {
     return n;
    }
    else 
    {
      return foo(n+1);
    }
}
 
public static void main(String args[])
{
   System.out.print(foo(3));
}
```

What is the output of the following code?
<pre><code class="language-Java">public static int foo(int n)
{
 if (n == 12)
 {
 return n;
 }
 else 
 {
 return foo(n+1);
 }
}
 
public static void main(String args[])
{
 System.out.print(foo(3));
}
</code></pre>

What is the output of the following code?
```Java
public static void recursiveFunc(int n)
{
    if(n == 0)
    {
     		System.out.print("False");
	   		return;
    }
    if(n == 1)
    {
     			System.out.print("True");
         return;
    }
    if(n%2==0)
    {
    		recursiveFunc(n/2);
    }
    else
    {
     		 System.out.print("False");
         return;
    }
}

public static void main(String args[])
{
     recursiveFunc(64);
}
```

What is the output of the following code?
<pre><code class="language-Java">public static void recursiveFunc(int n)
{
 if(n == 0)
 {
 		System.out.print(&quot;False&quot;);
	 		return;
 }
 if(n == 1)
 {
 			System.out.print(&quot;True&quot;);
 return;
 }
 if(n%2==0)
 {
 		recursiveFunc(n/2);
 }
 else
 {
 		 System.out.print(&quot;False&quot;);
 return;
 }
}

public static void main(String args[])
{
 recursiveFunc(64);
}
</code></pre>

This lesson will test your knowledge on recursion with numbers.

Fundamentals of Recursion

Iteration to Recursion

Recursion with Numbers

Recursion with Strings

Recursion with Arrays

Recursion with Data Structures

Quick Quiz on Recursion with Numbers!