New update is available. Click here to update.

Solve problems & track your progress

Checkout your overall progress in every topic here

Become

Sensei

in DSA topics

Open the topic and solve more problems associated with it to improve your skills

Check out the skill meter for every topic

See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

Problem

Submissions

Balanced parentheses

Contributed by

Deepanshu_1780

Last Updated: 23 Feb, 2023

Medium

0/80

Avg time to solve 10 mins

Success Rate 90 %

7 upvotes

Problem Statement

Given an integer ‘N’ representing the number of pairs of parentheses, Find all the possible combinations of balanced parentheses with the given number of pairs of parentheses.

Note :

Conditions for valid parentheses:
1. All open brackets must be closed by the closing brackets.

2. Open brackets must be closed in the correct order.

For Example :

()()()() is a valid parentheses.
)()()( is not a valid parentheses.

Detailed explanation ( Input/output format, Notes, Images )

Input format :

The first line of input contains an integer ‘T’, which denotes the number of test cases. Then each test case follows.

Each line of the test case contains an integer ‘N’ denoting the pair of parentheses.

Output format :

For each test case print, all the combinations of balanced parentheses separated by a single space.

The output of each test case will be printed on a separate line.

Note:

1. You don't need to print anything, it has already been taken care of. Just implement the given function.

2. You can return strings in any order.

Constraints:

1 <= T <= 5
1 <= N <= 10
Time Limit : 1 sec.

Sample Input 1 :

2
2
3

Sample Output 1 :

(()) 
()()
((())) 
(()()) 
(())()
()(())
()()()

Explanation for Sample Input 1 :

Test Case 1: 

For 2 pair of parentheses the combinations of balanced parentheses will be (()) ()()

Test Case 2:

For 3 pair of parentheses the combinations of balanced parentheses will be 
((())) (()()) (())() ()(()) ()()()

Sample Input 2 :

2
1
4

Sample Output 2 :

()
(((()))) 
((()())) 
((())()) 
((()))() 
(()(())) 
(()()()) 
(()())() 
(())(()) 
(())()() 
()((())) 
()(()()) 
()(())() 
()()(()) 
()()()()

Auto

Console