A string can contain only the characters A and B. The string formation must follow the following rules 1. The number of occurrences of A and that of B must be equal in the string 2. For any prefix of string, the number occurrences of A must be greater than or equal to the number of occurrences of B.
Now given an integer of length N, find the number of possible string formations adhering the rules above. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. 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.
