New update is available. Click here to update.

Posted: 2 Dec, 2020

Difficulty: Moderate

```
For ‘N’ = 3,
All possible combinations are:
((()))
(()())
(())()
()(())
()()()
```

```
Input consists of a single line containing a single integer ‘N’, representing the number of pairs in the parentheses.
```

```
For each test case print list of strings denoting all possible combinations for the given integer.
If there are multiple answers possible you have to print any one of them.
```

```
You are not required to print anything, it has already been taken care of. Just implement the function.
```

```
1 <= N <= 11
Time Limit: 1 sec.
```

Categories:

Popular Courses: