Extracting a named function that pigifies one word would also be preferable in real production code to using an anonymous function.

Refactored a bit, thx.

How about:

Write an algorithm to find the "unfairness" for a set of integers. We define the unfairness as the minimal difference between max(x1,x2,...xk) and min(x1,x2,...xk), for all possible combinations of k elements from the set.

Additional info:

• Values may be repeated

• Sets may contain up to 106 elements
• The value of k will range from 0 to the length of the set
• Empty sets have a minimum and maximum of 0

If you want to make constructive suggestions, be my guest :)

It could definitely be clearer.

C#-Translation kumited!

https://www.codewars.com/kumite/57f6159d9ac1e02a0600009d

Please check and approve it!

Danke schön

Really good kata! Thanx!

It is approved now!

Isn't the description clear enough?

What's the question?

Needs more test cases. Here's some:

• Hi
• What's up?
• Hey-come over