Err.. I think the question must be to print all the balanced parenthesizations given a number n. As the total number of balanced parentheses are given by Catalan Numbers, I think the answer for 3 must be ((())) ()(()) ()()() (())() (()()) for a total of 5. If not can you please confirm the source from where you got the question?
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/OuFzTaYhNlUJ. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
