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 Solvers11
Suggested Problems
-
187 Solvers
-
Lychrel Number Test (Inspired by Project Euler Problem 55)
118 Solvers
-
Method of Common Differences part-1
58 Solvers
-
Triangular matrices in 3D array
180 Solvers
-
308 Solvers
More from this Author329
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
