An array is given consisting of real integers , can hav repeatative elements , Now u need to find K partitions whose union will hav all the elements of the array , but the intersection of any pair of cannot hav K elements in common.
Exam:- Array- 1 1 2 2 3 1 4 3 5 For K=3 the partition are :- (1 2 3) (1 5 2) (1 4 3) cann't be :- (1 2 3)(3 1 2)(1 4 5) -- 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.
