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).
LMAO very impresive!
It seems that the final dot is missing in the sentence program should return if argument is greater than 0 in problem statement.
Hey! I'm new here. Can you please explain what you mean by brute force algorithm?
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.
Considering amount of coders submitted the exactly same solution, this one is clearly copy&paste from internet.
This is just beautiful.
I don't quite understand how logical IF operators are used here. Can someone explain?
jesus christ this was so easy
This comment is hidden because it contains spoiler information about the 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.
Hmm, that's interesting.
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.