This is just a glorified knapsack problem with additional flair wrapping the core task. There are already many published knapsack katas.

Hi,

Your output for the distribution tests should contain 3 strings ( your's contains 1 ). Read the description for more information.

• The above is an useless message and is very annoying to debug the solution => just show the actual and expected strings
• the sample tests should cover all cases (the sampel test that was asked for in the last message od this page still isn't there
• missing typical number of tests
• not enough fixed tests (since, they are the same as the sample tests)
• a first batch of small random tests (with reasonnable values) might be of use.

Cheers

"ascending" sounds like the numbers might have to be unique. "non-descending" would be unambiguous.

( this is very much like how "natural" or "positive" might or might not include zero, but "non-negative" would definitely be unambiguous. )

the indexing of the packages starts at 1, not at 0

Please use normal 0-based indexing. Why waste a perfectly good number? Just to try and frustrate your solvers? It adds nothing to the task, and it does detract.

let's name the drivers Jake and Alan accordingly

let's name them Jake and Elwood

apparently they've fallen on hard times :P