This week's book giveaway is in the Design forum. We're giving away four copies of Building Microservices and have Sam Newman on-line! See this thread for details.

i got this question that i dond have any clue what they want from me it says:

build a method that takes two integer numbers n>k>1 the method prints out all the subgroops if the size of k for example subs(4,2) prints 12,41,13,32,42,34

i cant find out was it the legality in these groops because it meeses 22 31 ??

It appears that they are looking for the number of ways you can select 'k' elements from 'n' elements (without considering arrangement). This is called COMBINATION (if arrangment is considered, it is called PERMUTATION).

In your example, '22' is disallowed because once '2' is picked from {1,2,3,4}, it cannot be selected again. Since we disregard arrangement, '31' is the same as '13', and '13' is a part of your "subgroup".

Am not sure if "subgroup" is a right terminology here, but I guess it depends upon the curriculum.

- Anand

"Perfection is achieved, not when there is nothing more to add, but when there is nothing left to take away." -- Antoine de Saint-Exupery

I’ve looked at a lot of different solutions, and in my humble opinion Aspose is the way to go. Here’s the link: http://aspose.com