Register for our webinar

### How to Nail your next Technical Interview

1 hour
1
Enter details
2
Select webinar slot
*Invalid Name
*Invalid Name
Step 1
Step 2
Congratulations!
You have registered for our webinar
Oops! Something went wrong while submitting the form.
1
Enter details
2
Select webinar slot
*All webinar slots are in the Asia/Kolkata timezone
Step 1
Step 2
Confirmed
You are scheduled with Interview Kickstart.
Redirecting...
Oops! Something went wrong while submitting the form.

## You may be missing out on a 66.5% salary hike*

### Nick Camilleri

Head of Career Skills Development & Coaching
*Based on past data of successful IK students
Help us know you better!

## How many years of coding experience do you have?

Oops! Something went wrong while submitting the form.

## FREE course on 'Sorting Algorithms' by Omkar Deshpande (Stanford PhD, Head of Curriculum, IK)

Oops! Something went wrong while submitting the form.

# Find All Well Formed Brackets Problem

Given a positive integer n, return ALL strings of length 2*n with well formed round brackets.

##### Example

Input: 3

Output:

[

"((()))",

"(()())",

"(())()",

"()(())",

"()()()"

]

Any array containing these five strings in any order is a correct output.

##### Notes

Input Parameters: Function has one argument, integer n.

Output Format: Return array of strings containing all possible well formed round brackets string of length 2*n. Order of strings in the returned array is insignificant, e.g. for n=2 both ["(())", "()()"] and ["()()", "(())"] will be accepted.

##### Constraints:

• 1

• Only use round brackets. '(' and ')'.

#### Solution

There are many possible solutions for this problem. Have a look at the solution provided by us.

##### Time Complexity:

O(2n * catalan number(n)).

##### Auxiliary Space Used:

O(2n * catalan number(n)).

##### Space Complexity:

O(2n * catalan number(n)).

### Try yourself in the Editor

Note: Input and Output will already be taken care of.

# Find All Well Formed Brackets Problem

Given a positive integer n, return ALL strings of length 2*n with well formed round brackets.

##### Example

Input: 3

Output:

[

"((()))",

"(()())",

"(())()",

"()(())",

"()()()"

]

Any array containing these five strings in any order is a correct output.

##### Notes

Input Parameters: Function has one argument, integer n.

Output Format: Return array of strings containing all possible well formed round brackets string of length 2*n. Order of strings in the returned array is insignificant, e.g. for n=2 both ["(())", "()()"] and ["()()", "(())"] will be accepted.

##### Constraints:

• 1

• Only use round brackets. '(' and ')'.

#### Solution

There are many possible solutions for this problem. Have a look at the solution provided by us.

##### Time Complexity:

O(2n * catalan number(n)).

##### Auxiliary Space Used:

O(2n * catalan number(n)).

##### Space Complexity:

O(2n * catalan number(n)).

## Worried About Failing Tech Interviews?

Attend our free webinar to amp up your career and get the salary you deserve.

Hosted By
Ryan Valles
Founder, Interview Kickstart
Accelerate your Interview prep with Tier-1 tech instructors
360° courses that have helped 14,000+ tech professionals
100% money-back guarantee*