This comment is hidden because it contains spoiler information about the solution
It's not a best practice! An algorithm with a dictionary is at least 5 times faster.
nice one
I think is not so fast, becuse O(26*n), but with use counter O(n)
best solution Zozo its incredible!!!
Well then...
why cant it use : from natsort import natsorted ? i guess its a shortcut but still.. in other katasu might use itertools numpy etc
Duplicate of "flatten an array" and "sum an array" katas.
too lazy
The suggestion below is actually an issue.
why cant I be this clever?
It wasn't an issue on my other Kata, as that uses int and not string. Assuming you are even talking about my Kata.
int
string
Anyway, thanks for the work. Accepted.
Done (didnt realize that for my previous translations thooo)
No there are no quotes in that string. so it ends up looking like this in the output:
testing for high_and_low(-1 -1 0)
So just add \" around the {arg}.
\"
{arg}
This comment is hidden because it contains spoiler information about the solution
It's not a best practice! An algorithm with a dictionary is at least 5 times faster.
nice one
I think is not so fast, becuse O(26*n), but with use counter O(n)best solution Zozo its incredible!!!
Well then...
why cant it use :
from natsort import natsorted
?
i guess its a shortcut but still..
in other katasu might use itertools numpy etc
Duplicate of "flatten an array" and "sum an array" katas.
This comment is hidden because it contains spoiler information about the solution
too lazy
The suggestion below is actually an issue.
why cant I be this clever?
It wasn't an issue on my other Kata, as that uses
intand notstring. Assuming you are even talking about my Kata.Anyway, thanks for the work. Accepted.
Done (didnt realize that for my previous translations thooo)
No there are no quotes in that string.
so it ends up looking like this in the output:
So just add
\"around the{arg}.Loading more items...