no u

• ###### kokiokcommented on "Opposites Attract" javascript solution

There is no need to use conditional statement?
like this return code, if it gives boolean itself, doesn't need to use conditional statement, right?

• ###### mcosme000commented on "Opposites Attract" javascript solution

Same here!! I was surprised when I saw this super simple line of code! I'm sure after some practice we will be able to think these solutions as well!! ✌🏻

• ###### SchriteFallowcommented on "Opposites Attract" javascript solution

I'm brand spanking new to coding (two weeks of self-studying) and seeing stuff like this is motivational.
I love seeing the different ways people think and approach problems--and how SIMPLE some code can be because of it.

• ###### scanningcommented on "Opposites Attract" javascript solution

I see XOR logic, good thinking.

• ###### webmisfitcommented on "Opposites Attract" javascript solution

Chorono79 toxic user

• ###### tidusiacommented on "Opposites Attract" javascript solution

You're right, probably better performance.

• ###### Chrono79commented on "Opposites Attract" javascript solution

Why not marking your coment as having spoiler content?

• ###### LegendaryIncommented on "Opposites Attract" javascript solution

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

• ###### JohanWiltinkresolved an issue on "Points On A Line" kata

After three years, it's been fixed or it ain't gonna be fixed.

Closing.

Oops. Fixed!

• ###### ThomasJazzcommented on "Find two doubles for the given sum and product" kata

1.25 * 7.8 = 9.75 NOT 9.85 as the example shows. Just so you know.

• ###### Goto10commented on "N-th Fibonacci" csharp solution

Not quite right. A recursive solution like this is exponential (at least 1.6^n). O(n) is actually very good.

• ###### DVRazorcommented on "N-th Fibonacci" csharp solution

Recursion would really be bad for big n, but since the return value is int you shouldn't expect values for n larger than 46.