Several problems in Cody deal with the practical problem of checking whether parentheses are correctly matched (e.g., 80, 465, 1303, 2653). In this problem you are asked to count the ways a given number of pairs of parentheses can be matched correctly in an expression. For example, three pairs can be matched in five ways:
()()(), (())(), (()()), ((())), ()(())
Write a function that takes the number of pairs and determines the number of ways the parentheses can be matched correctly.
Solution Stats
Solution Comments
Show comments
Loading...
Problem Recent Solvers8
Suggested Problems
-
Maximum running product for a string of numbers
2257 Solvers
-
290 Solvers
-
Back to basics 11 - Max Integer
811 Solvers
-
Rosenbrock's Banana Function and its derivatives
167 Solvers
-
Implement a bubble sort technique and output the number of swaps required
398 Solvers
More from this Author328
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
