that would be the Catlan number... Anil
On Thu, Jul 15, 2010 at 11:41 PM, mohit ranjan <shoonya.mo...@gmail.com>wrote: > @Ajeet > * > Google "Dyck words*" > > > Mohit > > > > On Mon, Jul 12, 2010 at 1:43 PM, aejeet <aej...@gmail.com> wrote: > >> 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 algoge...@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
