func1 and func 2 are delegates, a type that represent a calling site (a method somewhere).

It's like pointer of function in C/C++, but delegates in C# posses more informations than that (the instance of the object for non static method, ...)

This feature is used in many scenario: Event manamgement, Linq (to object), ...

Very interesting !!

This should be most efficient solution, especially if you replace new int[] { a, c }.Min() by Math.Min(a, c) and the same for Max.

"don't think you need the aggregate function, just join the array into a string and long parse it" - Using Aggregate performs the same job as Parse will, without needing to allocate a string to do it

not a fan of the magic numbers, don't think you need the aggregate function, just join the array into a string and long parse it.

Hi! Was onto that one. didn't use a while loop though. But the thought was the same. Although I could only pass the test and not the random tests. My question is: where does 48 comes from? Can't figure it out.

I like the solution without LINQ, you really know c# and algorithmic! good job!

In genetic algorithms you often want to use the concept of Elitism when you keep small amount of fittest chromosomes (2-4) unchanged by crossover. Otherewise best individuals are being replaced by random childrens. It highly improves performance here.

This conditional operator returns function, so second pair of empty parenthesis needed to call returned function.

I've added the adda test in C#.

Thanks.

Not enough tests. Most voted C# solution here returns true for "adda", while it should be false.

Wrong. This solution will return true for "adda", but it should be false.