Number of Ways of arranging N 0's, N 1's and N 2's such that number of 0's are always greater than equal to number of 1's till any place but not more than by K and similarly number of 1's are always greater than equal to number of 2's till any place but not more than by K?
-- 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.
