Given an array of values and a number of beggars, you are supposed to return an array with the sum of what each beggar brings home, assuming they all take regular turns, from the first to the last.
2 beggars will return a result of
[9,6], as the first one takes
[1,3,5], the second collects
The same array with
3 beggars would have in turn have produced a better outcome for the second beggar:
[5,7,3], as they will respectively take
Also note that not all beggars have to take the same amount of "offers", meaning that the length of the array is not necessarily a multiple of n; length can be even shorter, in which case the last beggars will, of course, take nothing
Want to propose a challenge idea for a future post? Email email@example.com with your suggestions!