Premium Content - Free Preview
This problem is scored like BlackJack II, but you need to deal with an array of numbers instead of one number:
In general, return the sum of a given list of numbers. If the sum is greater than
0, unless one or more of the numbers is
11. In such a case, as many
11's as necessary should be 'converted' to
1's to prevent the sum from being exceeded.