• ###### nitinaggarwal1986commented on "Greatest common divisor" javascript solution

Yes, you are right. I was just overthinking. In fact, I am shamelessly using this method in other katas now. Thanks!

• ###### mortonfoxcommented on "Greatest common divisor" javascript solution

It's not a big deal. The numbers would have to be ginormous, certainly far larger than the test cases in this kata, for the recursive gcd to use significant stack depth.

• ###### nitinaggarwal1986commented on "Greatest common divisor" javascript solution

Will this solution not increase the maximal recursion depth to obtain the solution?

• ###### danielosw22commented on "Greatest common divisor" javascript solution

damn boi, that's clever af

• ###### monadiuscreated an issue for "Tower of Hanoi" kata

I want to add one more requirement to this kata to make it substantially different from existing Tower of Hanoi kata. I will close this issue when I am done.

• ###### ӜЯℱӁℒᚹcommented on "Tower of Hanoi" kata

But it would be pretty common to find solutions that would work in both of them.

• ###### monadiusresolved an issue on "Tower of Hanoi" kata

Not a duplicate. The number of disks in this kata can be large so it cannot be directly solved with the same approach as kata in your links.

• ###### Opabiniacommented on "Multiply" clojure solution

Thanks, I'm glad you explained this.

• ###### monadiusresolved an issue on "Tower of Hanoi" kata

Added more tests (including random tests and large tests).

• ###### AliFoxExamplescommented on "Greatest common divisor" javascript solution

my self esteem after seeing these 1 line solutions be like "not stonks".

• ###### UshakovMaksimcommented on "Greatest common divisor" javascript solution

The maximal recursion depth is limited by JavaScript engine. We can rely on it being 10000, some engines allow more, but 100000 is probably out of limit for the majority of them. There are automatic optimizations that help alleviate this (“tail calls optimizations”), but they are not yet supported everywhere and work only in simple cases.

• ###### afirsov410commented on "Fluent Calculator" kata

I was confused that math operators precedence is not taken into account: FluentCalculator.ten.plus.two.times.five should be in this kata 60, not 20 as one may expect. Anyway, great kata!

I hate you

• ###### Neocortexxcommented on "Greatest common divisor" javascript solution

That's true! Thank you!