Reference solution is incorrect:

courier(['e1', 'e2', 'n3', 'n3', 's2', 's2'], 3)
30 should equal 32

Delivering every package without counting package loading time takes 26 minutes. It then should take only 2 loads to deliver all packages (6 / 2 = 3), not 3, so the expected time should be 26 + 2 * 2 = 30, not 32.

(Loading time is independent of direction, otherwise the fixed tests will not match)

C#: method name should be PascalCase (Please refer to implementation of backward compatibility here )

A sensitive topic that should be avoided..

now do it in O(n) time with O(1) extra space

gotcha.

...because that would have been an incorrect formula.

Test failed with month = 1: 0 should equal 1
Test failed with month = 7: 2 should equal 3
Test Passed
Test Passed
Test Passed
Test failed with month = 4: 1 should equal 2
Test failed with month = 2: 0 should equal 1
Test failed with month = 10: 3 should equal 4
Test failed with month = 11: 3 should equal 4
Test failed with month = 8: 2 should equal 3
Test Passed
Test failed with month = 5: 1 should equal 2

Java translation

Should work as intendet, if it is OK it can be approved.

Thats the most interesting kata so far. Liked it so much.

Thanks for for such a pandepic kata! There are so many ways it can be solved - I learned a lot.

Thank you for this kata! Nice mind puzzle:)

Works great! Thanks :)

Thanks, I added some more test cases. Does that work for you?

Okay. Hopefully, I corrected the failure with the latest republishing :-)