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 Solvers7
Suggested Problems
-
Get the area codes from a list of phone numbers
1075 Solvers
-
Return elements unique to either input
811 Solvers
-
Compute a dot product of two vectors x and y
1051 Solvers
-
Longest run of consecutive numbers
6552 Solvers
-
5875 Solvers
More from this Author323
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
