• ###### OMahoneyMcommented on "Sum of numbers from 0 to N" kata

This is a terribly presented challenge and a waste of time.

• ###### JackUnicorncommented on "Give me a Diamond" javascript solution

`.repeat` also depends on `n` so time complexity is O(nlogn)

• ###### Kawesomecommented on "Data Reverse" javascript solution

how? or this sarcasm?

• ###### Victor Benedictcommented on "Enumerable Magic - Does My List Include This?" javascript solution

He's already in 3rd kyu. Why bother?

same!

• ###### Nika2004commented on "Find Nearest square number" javascript solution

work smart not hard

• ###### half.ctocommented on "Simple Encryption #1 - Alternating Split" javascript solution

yes, same here :)

• ###### teranetmkcommented on "Fuel Calculator " javascript solution

mine is just O(1) and a line without if Condition.

• ###### emmaboyniccommented on "A Rule of Divisibility by 13" javascript solution

same idea but longer

• ###### SMD_ASYcommented on "Sum of numbers from 0 to N" kata

Agree, only for this case special format output....

• ###### cmorriscommented on "Non-even substrings" kata

JavaScript won't divide very large numbers properly if you try to divide the ordinary way. Try figuring out if each substring coerced to a number is odd or not without dividing the entire number.

• ###### emmaboyniccommented on "Bob's Short Forms" javascript solution

same solution!

• ###### emmaboyniccommented on "Rainfall" kata

expected 51.199999999999996 to be close to -1 +/- 0.01

• ###### emmaboyniccommented on "Digital cypher" javascript solution

same idea but not a one liner