Count Brackets
easy
1. You are given a number n, representing the number of opening brackets ( and closing brackets ) 2. You are required to find the number of ways in which you can arrange the brackets if the closing brackets should never exceed opening brackets e.g. for 1, answer is 1 -> () for 2, answer is 2 -> ()(), (()) for 3, asnwer is 5 -> ()()(), () (()), (())(), (()()), ((()))
Constraints
0 <= n <= 15
Format
Input
A number n
Output
A number representing the number of ways in which you can arrange the brackets if the closing brackets should never exceed opening brackets
Example
Sample Input
4
Sample Output
14
Question Video