Register for our webinar

How to Nail your next Technical Interview

1 hour
Loading...
1
Enter details
2
Select webinar slot
*Invalid Name
*Invalid Name
By sharing your contact details, you agree to our privacy policy.
Step 1
Step 2
Congratulations!
You have registered for our webinar
check-mark
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
check-mark
Confirmed
You are scheduled with Interview Kickstart.
Redirecting...
Oops! Something went wrong while submitting the form.
close-icon
Iks white logo

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
Iks white logo
Help us know you better!

How many years of coding experience do you have?

Thank you! Your submission has been received!
Oops! Something went wrong while submitting the form.
Iks white logo

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

Thank you! Please check your inbox for the course details.
Oops! Something went wrong while submitting the form.
closeAbout usWhy usInstructorsReviewsCostFAQContactBlogRegister for Webinar
Our June 2021 cohorts are filling up quickly. Join our free webinar to Uplevel your career
close

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.

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

Recommended Posts

All Posts