Shouldn't the upper bound for the numbers in random tests be increased? Cause, 100 is too low and it allows brute-force solutions, which makes the kata 8 kyu imo.

So apparently, the author himself used brute-force solution.

Haskell translation

Java Translation (author inactive).

approved

C Translation (author inactive).

Just a hint for those of you that are stuck: using index() with duplicates will always go back to the first occurence in the list. For example, you might be having this [0,2,2,2,5,6] simply because using s2[s1.index(elemnt)] will loop back to the first occurence.

i like the idea, but, do we want this to work?

https://www.codewars.com/kata/reviews/5893f1e949da57bb7a0000fc/groups/5e26c34a236735000121b01e

First of all, the weights shouldnt only be 1 and 2.
Second of all, secret_weight, isn't very secret.
Lastly, why arent there any random tests?

Done.

Merged

THE INSTRUCTIONS ARE NOT CLEAR!!!!!!!!

JS fix

• The random tests use global variables and can very easily be circumvented.
• Also fixes this issue

Fixed after 5 years :-)

Approved

python new test framework + random tests are required. updated in this fork

what the fun??? i took more than 30min to solve normally, but u did in list comprehension!!! salute ;-)