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

# Problem Statement
Implement a function that takes an array `testVariable` containing opening `(` and closing parenthesis `)` and determines whether or not the brackets in the array are balanced. The function also takes `startIndex = 0` and `currentIndex = 0` as parameters.

## What does "Balanced Parenthesis" Mean?
**Balanced parentheses** mean that each opening bracket `(` has a corresponding closing bracket `)`. Also, the pairs of parentheses are **properly nested**. 

Consider the following correctly balanced parentheses:
```````````
 ()

 (())

 (())()

 ((())) ((()))
`````````````
Now take a look at some incorrectly balanced parentheses:
`````````
 (

 )()(

 ((()()()()

 ((())))((((()
```````````
### Input

An array `testVariable` containing opening and closing parentheses.

### Output
`True` if the parentheses in the input array are balanced. `False` if the parentheses in the input array are imbalanced.

### Sample Input
```python
testVariable = ["(", ")", "(", ")"]
```

### Sample Output
```python
True
```

## Try it Yourself
Try this challenge yourself before examining the solution. Good luck!

Given an array that contains opening and closing brackets, check whether or not the brackets are balanced in the array.

Recursion Fundamentals

Iteration Vs. Recursion

Recursion with Numbers

Recursion with Strings

Recursion with Arrays

Recursion with Data Structures

Conclusion

Challenge 2: Balance Parenthesis

Problem Statement