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
-
Find the longest sequence of 1's in a binary sequence.
6849 Solvers
-
108 Solvers
-
1469 Solvers
-
Getting the absolute index from a matrix
259 Solvers
-
58 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!
