Awesome kata, thank you! I absolutely love both the challenge and the historic introduction.

You can use console.log to print the data to stdout.

The numbers are actually correct

item | pts | free| pay
  0  | 31  |  1  | 0
  1  | 26  |  2  | 0
  2  | 21  |  3  | 0
  3  | 16  |  4  | 0
  4  | 11  |  5  | 0
  5  |  6  |  6  | 0
  6  |  1  |  7  | 0
  7  |  2  |  7  | 1
  8  |  3  |  7  | 2
  9  |  4  |  7  | 3
 10  |  5  |  7  | 4
 11  |  0  |  8  | 4
 12  |  1  |  8  | 5
 13  |  2  |  8  | 6
 14  |  3  |  8  | 7
 15  |  4  |  8  | 8
 16  |  5  |  8  | 9
 17  |  0  |  9  | 9
 18  |  1  |  9  | 10
 19  |  2  |  9  | 11
 20  |  3  |  9  | 12
 21  |  4  |  9  | 13
 22  |  5  |  9  | 14
 23  |  0  | 10  | 14
 24  |  1  | 10  | 15
 25  |  2  | 10  | 16
 26  |  3  | 10  | 17

The kata is vulnerable to simple exploits like this:

def plus_or_minus(variables, test):
    return test.__self__.expr

(https://www.codewars.com/kata/reviews/65f8713d2a5c600001d40e8a/groups/66a7f0443fd52196719dc60a#66d498d675252935bab4bdbf)

This is an attempt to fix the issue by converting Tester to a function factory.

That's probably because the kata was changed after this fork was published (fixing Kayleigh's issue above).

I republished the fork: https://www.codewars.com/kumite/66d71fe89cee54b0364ef568?sel=66d71fe89cee54b0364ef568

Python: Kata is vulnerable to certain exploits.

Details and proposed fix: https://www.codewars.com/kumite/66d5bb6300f911da4ce22e12?sel=66d5bb6300f911da4ce22e12

The kata is vulnerable to simple exploits like this:

def plus_or_minus(variables, test):
    return test.__self__.expr

(https://www.codewars.com/kata/reviews/65f8713d2a5c600001d40e8a/groups/66a7f0443fd52196719dc60a#66d498d675252935bab4bdbf)

This is an attempt to fix the issue by converting Tester to a function factory.

Attempt to solve this with function factory: https://www.codewars.com/kumite/66d5bb6300f911da4ce22e12?sel=66d5bb6300f911da4ce22e12

Isn't that technically cheating?

In computing, the modulo operation returns the remainder or signed remainder of a division, after one number is divided by another (called the modulus of the operation).: https://en.wikipedia.org/wiki/Modulo

Your solution is too slow.

@seika-afk The question is "How many digits?", so just count the digits :)

This was super satisfying, thank you!

At first I found a "simple" soultion that barely passes under 12s, but then it dawned on me in all its simplicity. It's like climbing a mountain in the dark to see the sun rise behind it.

Nevermind, the problem you experience is because you're mutating the original list.

l = [1,2,3]
n = l
n is l # returns True
del n[0]
l == [2, 3] # returns True

Make a copy of l to fix your problem.

If so, please do the following:

• Make absolutely sure the problem is not in your code
• Add a comment labeled as "Issue"
• Describe in detail what you experience and what you expect, and in what language

If there is an issue, someone might come and fix it. However, it's just not possible to fix "a problem" in unknown language.