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
-
293 Solvers
-
Project Euler: Problem 4, Palindromic numbers
972 Solvers
-
118 Solvers
-
Map all the indices of an Array Indices into a Vector giving Index vs Row and Column
39 Solvers
-
Find out missing number from a vector of 9 elements
290 Solvers
More from this Author250
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!