Ram and Shyam are playing a game of balls. Ram choose a colour ball say red and shyam chose blue. Now both of them places the ball in a row with the condition that at any point the number of Shyam's balls can never be larger than Ram's. If both of them have equal number of balls say 'n' compute the number of ways in which all the 2n balls can be arranged. For n=3 number of ways would be 5
Find a linear solution for the same -- 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.
