Toy tests fails with ValueError: max() arg is an empty sequence if solution is differently rotated. E.g. "AACGTTCG" for first test.

This problem can be reduced to the set cover problem, which is NP-hard, looking at size of tests I can assume that reference solution uses some king of greedy approach, which do not guaranty optimal solution.
Example A = [3, 8, 8, 6, 7], B = [2, 2, 3, 5, 6], k = 6. My solution is 3. First thief can take from jars 1 and 4 second from 2, third from 3 and 5

Approved

Approved. 7kyu average rank

You are a hard working person :)

In random tests you sholdn't recareate object Battle before each call of play_turn.

approved

approved

Nice challenging kata. People usually afraid of katas with long description. But this description covers all cases with examples. Small issue: there are unmatched brackets in last two examples in description. Suggest tag: ASCII Art.

The function failed! f(x) = 24.3+(83.3/(69.3*(x^x*x^42.3-9.7^76.5/87.9^x*92.5^2.5)^x/log(x*4.7^x/49.3)^28.4-21.2)^x/x), x = (-4.69,8.75)

Expected: equal to (24.3,7.17589e-06) (+/- (0.0078125,0.001))

Actual: (1.03767e+18,-1.20504e+19)

wolframalpha gives me result: 1.03767×10^18 - 1.20504×10^19 i

It's hard to find solution, including mine, which will have chance to pass random tests in first ten attmpts.

Approved

Approved

approved