• ###### ejini战神resolved a question on "Steps in Primes" kata

Your solution is O(N) + O(N) + O(N^2) in which the kata can be solved with an O(NLogN) algorithm. Read about how the `step` helps in deducing the output primes.

• ###### taernsietrcommented on "Beginner Series #3 Sum of Numbers" rust solution

AFAIK, it's because i64 implements the trait Ord, which contains those methods.

• ###### lxg95commented on "Multiplication table" python solution

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

• ###### ryanmattoscommented on "Count the smiley faces!" typescript solution

That's because you dont need the parenthesis inside the brackets (character set)

• ###### akar-0resolved an issue on "Find the unique string" kata

Changed to more than 2 strings.

• ###### swarnabhKcommented on "Multiplication table" python solution

Great use of the range function. Creating a range function is O(n) right?

• ###### RealNimrodcommented on "Multiplication table" python solution

Yes, runtime on this solution will be n^2 since they are entering every number 1 by 1 and it's an N * N table which means N^2 items will need to be entered.

• ###### mauro-1commented on "Find the unique string" kata

Other languages (e.g. python) have examples with three strings.
IMHO examples are correct and description should be "at least 3 strings"

• ###### Chrono79commented on "Find the unique string" kata

Please mention the language you're talking about when reporting an issue (if the kata has more than one language available ofc).

• ###### PoLáKoSzcommented on "Steps in Primes" kata

Did You solved the kata? I'm not a JavaScript expert, but the `IsPrime` function looks OK to me. To spead up your code just find the first prime number add `step` to it and if it's a prime then You found the result.