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.
Solve

Solution Stats

17 Solutions

10 Solvers

Last Solution submitted on Jul 14, 2026

Last 200 Solutions

Solution Comments

Show comments

Problem Recent Solvers10

Chris Cleveland George Berken Christian Schröder Lorenzo

Suggested Problems

More from this Author328

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!