Back to course home

0% completed

# Solution: Balanced Parentheses

## Problem Statement

For a given number ‘N’, write a function to generate all combination of ‘N’ pairs of balanced parentheses.

**Example 1**:

```
Input: N=2
Output: (()), ()()
```

**Example 2**:

```
Input: N=3
Output: ((())), (()()), (())(), ()(()), ()()()
```

**Constraints:**

`1 <= n <= 8`

## Solution

This problem follows the `Subsets`

pattern and can be mapped to `Permutations`

. We can follow a similar BFS approach.

Let’s take Example-2 mentioned above to generate all the combinations of balanced parentheses. Following a BFS approach, we will keep adding open parentheses `(

.....

.....

.....

Like the course? Get enrolled and start learning!