• ###### farhanadityacommented on "Array of all primes up to number N" kata

@akar-0 it's the translator's responsibility to ensure the difficulty stays the same.

• ###### farhanadityacreated a suggestion for "Array of all primes up to number N" kata

Initial Solution Setup:

``````var primeArray = function(n) {
var primeArray = [];
// fill it with primes up to 'n'
return primeArray;
}
``````

I don't think overwriting its own function is a good practice.

• ###### ejini战神created an issue for "Array of all primes up to number N" kata
• Ruby 3.0 should be enabled (Refer this & this for more detail)

yes, thanks

• ###### akar-0resolved an issue on "Array of all primes up to number N" kata

It often happens kata difficulties are very different from one language to another.That may be because of different builtin functions, sometimes because tests are not equitable... If we follow this, many katas should be restricted to a few languages, or exclude some others... For example a language like C has very few builtin functions in comparison with others... so what should we do? Restrict translations of original C katas and Restrict translations of other languages to C? Moreover when languages are updated they may have new builtin functionalities. This is not actually manageable, this is a very general issue on CW, it's part of it, we have to do with it.

• ###### Bogdan Pasterakcommented on "Check if a number is a part of an arbitrary fibonacci sequence" kata

It made me a little bit wrong. I thought that a and b chould be elements of sequences, and they were any numbers.

• ###### cliffstampcreated an issue for "Array of all primes up to number N" kata

This comment is hidden because it contains spoiler information about the solution

• ###### Unnamedcommented on "Javascript 'modulo' fix" kata

Not for integers though and the point here is to make it work like in standard maths, so I don't see a problem here.

• ###### Voilecreated an issue for "Javascript 'modulo' fix" kata

`b=0` should result in `NaN`, not `undefined`. That's how modulo works everywhere.

• ###### bestwebuacommented on "Array of all primes up to number N" kata

Thanks for the nice kata!

• ###### JohanWiltinkcreated an issue for "Javascript 'modulo' fix" kata

Needs a static test case for `a` and `b` having a different sign and the expected modulo being zero.

The random tests do not always catch this scenario, and it's a possible failure mode for a certain naive solution.

• ###### g964commented on "Perimeter of squares in a rectangle" kata

Good and thanks for your feedback!

• ###### otammcommented on "Perimeter of squares in a rectangle" kata

Thanks for the reply! Yep, it worked, take a look at my solution.

• ###### g964resolved an issue on "Perimeter of squares in a rectangle" kata

I mis-spelled a function in the reference solution... my mistake:-( and nobody saw it before! Now that the kata has been passed by more than 500 CW I can't modify the tests anymore.
If you want to pass in JS or Coffeescript, take the part of your function that calculate Fibonacci numbers, make this part as an auxiliary outer function that you name `fib` and it should pass.
Sorry for the inconvenience! Please could you tell me if you succeed with this modification?

• ###### otammcreated an issue for "Perimeter of squares in a rectangle" kata

Good kata, however, this error is outputing in the Javascript version:

``````   at perimeters
at tests_code
at Object.Test.describe```

There's not any mention of a 'fib' variable in the description and I've successfully completed the C# version using the exact same variable names and solution logic, so either I'm missing something or there's a potentially big issue which gets in the way of completing the kata.
``````