Why should your code be efficient, if it works although it's slow? :)
See answers to Agboola O.D. posts below, and actually many other posts in this discourse.
returns an array with all of the integer's divisors(except for 1 and the number itself)), from smallest to largest. If the number is prime return the string '(integer) is prime'
If you meant the description should have the definition of what a prime number is, it assumes you know that (or you can google it).
When I put my code into test, it says that everything went correct but when I attempt, it says something about random inputs that couldn't be computed.
Try printing the output and you'll know, or read this
You have to have higher honor. Hover over your profile and then go to New Kata(once you are able to make one ofc.) Also, make high quality katas.
Where can i create exercises?
Why should your code be efficient, if it works although it's slow? :)
See answers to Agboola O.D. posts below, and actually many other posts in this discourse.
Why is my code not efficient enough although everything works? This is a bit weird
If anyone struggles with this exercise: The numbers that you can divide with the weight must be even too.
can you rephrase that? thanks
Dude, you know that it will your performance 😆
Then why didn't you use
Suggestioninstead?It's already there:
If you meant the description should have the definition of what a prime number is, it assumes you know that (or you can google it).
This comment is hidden because it contains spoiler information about the solution
This comment is hidden because it contains spoiler information about the solution
your code passes the
sampletests but when you click ATTEMPT your code is run against additionalfixedtests and usually another a set ofrandomtestsWhen I put my code into test, it says that everything went correct but when I attempt, it says something about random inputs that couldn't be computed.
How to fix?