Topic: Divide And Conquer Problem / Level: intermediate

Problem: Write a divide and conquer algorithm to solve the problem of counting the number of valid arrangements of parentheses for n pairs.

Run the code to see the output here...