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
-
2272 Solvers
-
249 Solvers
-
85 Solvers
-
middleAsColumn: Return all but first and last element as a column vector
647 Solvers
-
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
2037 Solvers
More from this Author321
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
