Problem 47838. Count the ways pairs of parentheses can be matched correctly
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 commentsProblem Recent Solvers5
Suggested Problems
-
Remove any row in which a NaN appears
8405 Solvers
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
1658 Solvers
-
Make an awesome ramp for a tiny motorcycle stuntman
610 Solvers
-
172 Solvers
-
199 Solvers
More from this Author244
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!