Loading collection data...
Collections are a way for you to organize kata so that you can create your own training routines. Every collection you create is public and automatically sharable with other warriors. After you have added a few kata to a collection you and others can train on the kata contained within the collection.
Get started now by creating a new collection.
Nice kata. Thanks!
Nice kata, it was fun to work on it :)
I found one minor issue though. The description describes the scape value as the iteration in which the modulus gets above
3
and the provided pseudo code reflects that:But in practice you use
c.modulus >= 3
and notc.modulus > 3
.Thanks you very much for this kata, I had a lot of fun solving it!
Thanks for this kata. It is a shame you reduced the performance requirements of the problem. Consider creating a harder version - The Matrix Reloaded or similar :) - for a more challenging one.
It makes sense. Thanks for the advice!
That is a shame :(. I will try a different approach then
This was an interesting kata. I have translated it to ```java``; feel free to merge it if you like the implementation.
I have also added in this translation some random tests and some extra information to the tests output, I hope that is fine with you.
Thanks for this kata. I translated it to
java
, feel free to merge it if you are happy with the translation.Nice kata! I had very little exposure to Java8 streams API and I learned some interesting things with this one.
Really nice kata! Thanks a lot for creating it. I have translated it to
java
in case you are interested.This comes later than I expected!
java
translation is ready. Let me know if something is not quite right and I will happily update it.I would suggest to new extra sequences to test:
1 2 3 4 55
and a string with no numbers and spaces_______
Thanks for this kata! I have translated it to
java
and added some extra tests. Please let me know if that is fine with you.No problem. I'm happy I can contribute :)
This comment is hidden because it contains spoiler information about the solution
Loading more items...