Fixed Tests: lenCurve
At 1e-06: Expected must be near 1.478197, but got 1.478942

Desmos verification: 1.478942 85754

Wolfram verification: 1/4 (2 sqrt(5) + sinh^(-1)(2)) ~ 1.478942 85754459743382790601943391443507169743059500825188121224933538336352

Node v18 is enabled now. Closing.

No:

Assume the key is repeated for the length of the text, character by character. Note that some implementations repeat the key over characters only if they are part of the alphabet -- this is not the case here.

It's been already discussed 4 years ago: https://www.codewars.com/kata/52d1bd3694d26f8d6e0000d3/discuss#6050b777d2342a000e60697f

The test for c.encode("it's a shift cipher!") is broken. Actual value for assertion should be "xt'k s ovzii cahdsi!" in Java.

Understood.

This kata was Auto-retired.

I did not get any feedback as to why this kata got retired, so whoever did this, just tell me instead of setting this kata as retired.

What world are you living in where this is difficult? It took me at most 5 minutes to solve this kata.

I disagree with you: why should a basic kata, which only handles multiples and simple exception cases, be classified as a 6 level?

I have followed your suggestion and updated the code accordingly. Hopefuly this should be good, otherwise, please leave more feedback.

Thank you for your suggestion, I will look into it.

A good debugging kata should have 1-2 logic errors, not 200 typos.

20 minutes adding/editing all semicolons, operators, parens, types, ... is too boring.

I'm not sure that the kata's difficulty level really fits the problem.

"Rest assured, the worst she can say is no!"