A good try is to make the algorithm as simple as possible, with the least wrapping with object, the least function calls nd the simplest loop. In some languages it is enough to let you go below the 12 second, although not with a great margin.
One hint is in the description itself. As k and n grow the sum converges, suggesting that you may not need to care about terms that are too small. the test even gives away the tolerance error.
A last technique, somewhat advanced but very useful an generic, is memoization.
This comment is hidden because it contains spoiler information about the solution
Random tests added for Ruby, in this fork
Please see this js fork adding random tests
approved
JS: Currently available in Node v18.x, resolving
This comment is hidden because it contains spoiler information about the solution
Approved by someone
It seems the author of the question has solved this kata with fixing their mistake, so closing this question~
A good try is to make the algorithm as simple as possible, with the least wrapping with object, the least function calls nd the simplest loop. In some languages it is enough to let you go below the 12 second, although not with a great margin.
One hint is in the description itself. As k and n grow the sum converges, suggesting that you may not need to care about terms that are too small. the test even gives away the tolerance error.
A last technique, somewhat advanced but very useful an generic, is memoization.
.
approved
Was about to say the opposite...
Approved! +1 Thanks
Loading more items...