Question: Your task is to find the number of ways that you can put those brackets in such a way that they will be always balanced after taking the n pair of brackets from the user in Java Language.
Required:
Question:
Your task is to find the number of ways that you can put those brackets in such a way that they will be always balanced after taking the n pair of brackets from the user in Java Language.
Approach:
PRE-REQUISITE:
A balanced pair is that if there are opening brackets there will always be closing brackets for them.
Take the number from the user using the scanner class object.
Algorithm:
Think in this manner like if we have 1 pair then only 1 possibility.
if we have 3 pairs : then possible outcomes will be: ()()(), ()(()), (())(), (()()), ((())).
so this series seems like Catalan number series.
So use that formula & for reducing the time complexity we can use the tabulation technique of the dynamic programming and print the nth space value on the console.
for further help, please see the code below with the output.
Step by step
Solved in 4 steps with 4 images
