Hello, how much permutation i must to do for any test?
python fork
The description is little cryptic, I have to look at the examples to figure out the output. I don't know if you did that on purpose.
This comment is hidden because it contains spoiler information about the solution
Randomness isn't actually required.
why not?
I will think how to fix this issue (or whether it really needs fixing ;) ).
Covering such scenario would need a carefully crafted data set, I think it won't be easy to get one randomly. I will think of something.
It seems to be better than other solution I checked(in codewars), because it calculate "0.1" * "2". And other decimal multiplication. Other solutions I checked didn't work for decimal.
Just to say your code is clever. For mine I have used sklearn so I fill like cheating
double precision is enough ;)
Yes that's right!
That's O(n), and so it makes the code O(n^2), which is not desirable.
O(n)
O(n^2)
Loading collection data...
Hello, how much permutation i must to do for any test?
python fork
The description is little cryptic, I have to look at the examples to figure out the output. I don't know if you did that on purpose.
This comment is hidden because it contains spoiler information about the solution
Randomness isn't actually required.
why not?
I will think how to fix this issue (or whether it really needs fixing ;) ).
Covering such scenario would need a carefully crafted data set, I think it won't be easy to get one randomly. I will think of something.
This comment is hidden because it contains spoiler information about the solution
It seems to be better than other solution I checked(in codewars), because it calculate "0.1" * "2". And other decimal multiplication.
Other solutions I checked didn't work for decimal.
Just to say your code is clever. For mine I have used sklearn so I fill like cheating
This comment is hidden because it contains spoiler information about the solution
double precision is enough ;)
Yes that's right!
That's
O(n)
, and so it makes the codeO(n^2)
, which is not desirable.Loading more items...