Second and third sample tests seem to be wrong :

• [(-2, 5), (4, -1), (4, 11), (10, 5)]

  For n = 10: [4, (4, 11)] should equal [4, (4, -1)]

• [(260, 120), (264, 92), (264, 148), (280, 60), (280, 180), (300, 40), (300, 200), (332, 24), (332, 216), (360, 20), (360, 220), (388, 24), (388, 216), (420, 40), (420, 200), (440, 60), (440, 180), (456, 92), (456, 148), (460, 120)]

  For n = 100: [20, (420, 40)] should equal [20, (420, 200)]

• There are many ways to sort an array, you have to be explicit.

• Use katex for math formulas :

  (x – h)^2 + (y – k)^2 = r^2
  

• Description has be rewritten to correspond to actual quality standards.

• In light mode, your example is hard to see.

This one is crazily cool and rewarding. It should be translated to Python by a someone.

ReferenceError: MYSUPERENCRIPT is not defined

encrypt, decrypt

f(n) =  \begin{cases} \frac{n}{2} \quad &\text{if }& n \equiv 0 \pmod{2}\\ 3n + 1 \quad &\text{if }& n \equiv 1 \pmod{2} \end{cases} 

I tried to reduce my code for days, not understanding why my formula was wrong!

In the sample tests tester("11000", "01111", 4, 1):

Remove components 1 and 2, price of 1, quality of 4

Isn't it :

Remove component 1, price of 1, quality of 4

To prevent bad understanding, maybe add in the description that indices are 1-based in your sample tests.

Cool, but the output should be a string.

expected false to be true

Is not a very useful message!

• You are not peventing the use of builtin functions that way.
  Look at B4B's modules forbidder.
• You are disallowing recursive implementations because the function you require contains the word sort.

There are annoying deprecation messages :

assertSimilar is deprecated, use assert.deepEqual

The last two sample tests need to be changed :

n_vals = [[1, 0], [2, 3], [3, 18], [4, 60], [5, 150], [342, **420115062**], [56753, **386209565**]]

Cool one!

Another curious number :496, there are so few...

.