can you please explain it

Most of the solution to this kata is not recursive !!!

can you please add some sort of validation

Thanks

I found this kata more difficult in javascript as compire to Python !!! Great kata

Can you please explain your solution?

After 2 hours of struggling !!! I did it , Great kata :)

Hey, I didn't say anything about your english, You speak good english,much better than me!!!

Problem is with me, i am failing to understand this kata even though i tried with examples. that's why i need your help,

can you please explain me with one example -

filter1 = shortenNumber(['','k','m'],1000); // return a function which takes one argument,

filter1('234324') == '234k'; // How '234324' => '234k'

filter1('98234324') == '98m'; // How '98234324' => '98m'

filter1([1,2,3]) == '1,2,3'; // this one i got it, if function didn't get a string argument, function 'll return argument.toString()

thanks again !!!!

Hi, still didn't understand,
I got this that i have to return a function, but what would that function do?
can you please explain this line -
Given an initial array of values replace the Xth power of a given base
and this one -
taking parameters to pre-set itself.
Thanks again !!!

Can anyone explain this kata to me. Thanks

Frustrating .....

me too

Thanks a lot :)

OMG ... you are a legend !!!

Hi, I didn't get last line || return names[Math.ceil(names.length * r / l)-1]; || can you please explain ?