• ###### Mr. Dr.commented on "Product of consecutive Fib numbers" javascript solution

I'm forced to reply to the wrong person, but here we go

Brute force generally means to generate every possible combination until you find one that gives you an answer. In this case, it refers to starting from the bottom of the fibonacci sequence and progressing through it until you arrive at a stopping case (fib(n) * fib(n+1) >= prod).

Great

• ###### ptdedecommented on "Product of consecutive Fib numbers" javascript solution

LMAO very impresive!

• ###### deladancommented on "More than Zero?" kata

It seems that the final dot is missing in the sentence program should return if argument is greater than 0 in problem statement.

• ###### Mr. Moonjerincommented on "Product of consecutive Fib numbers" javascript solution

Hey! I'm new here. Can you please explain what you mean by brute force algorithm?

• ###### Firefly2002commented on "Sum by Factors" javascript solution

Bit sad given it's not exactly a tough problem. I wouldn't even know how to Google for this, though. I feel like if you knew what terminology to Google you already have a math background.. so wouldn't that make this even easier? This solution is also quite slow.

• ###### metalimcommented on "Sum by Factors" javascript solution

Considering amount of coders submitted the exactly same solution, this one is clearly copy&paste from internet.

too cool!!

• ###### peter_jacuzzicommented on "Product of consecutive Fib numbers" javascript solution

This is just beautiful.

• ###### Inkycommented on "Last digit of a large number" javascript solution

I don't quite understand how logical IF operators are used here. Can someone explain?

• ###### sw-yxcommented on "Hard Time Bomb" javascript solution

jesus christ this was so easy

• ###### knight-Zcommented on "Merged String Checker" javascript solution

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

• ###### dayfinecommented on "Sum by Factors" javascript solution

Since Array would start with 0, I guess to make sure the last item in marked[] will corresponed to the largest num (in abs) in the lst[]? This way if that num itself is a prime number, say 101, this prime factor, i.e. itself, will also be included in the calculation.

• ###### Voilecommented on "Find heavy ball - level: conqueror" javascript solution

Hmm, that's interesting.

• ###### laoriscommented on "Find heavy ball - level: conqueror" javascript solution

The original kata required you to directly access the Scales object's attributes. tiriana updated the kata 2 years ago with the better API, but left the old attributes accessible for backwards compatibility. See the kata disccusion for details.