Find the number of expressions containing $n$ pairs of parentheses which are correctly matched. For example, when $n=3$, the answer is $5$ because all the valid expressions are $$((())),\ (()()),\ (())(),\ ()(()),\ ()()()$$
The solution for this problem is available for $0.99.
You can also purchase a pass for all available solutions for $99.