Combination of Brackets

CodeChefOpen on judge ↗

Jack and Tony are two brothers. Tony loves playing with brackets and Jack loves combinations.One day their father gave them N bracket pairs and asked them to count the number of valid combinations of brackets that can be formed using exactly N bracket pairs. All the bracket pairs are of same type say { }. A combination with no brackets is valid. If S is a valid combination of brackets then { S

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI