There're already similar katas, e.g. this.

Probably not in JS.

Retired - no use keeping the issue open

Retired anyway

There was a kata about that, but you had to exception out of your function to determine how deep you were.

Is there a workable way to determine from outside the function how deep into it you are? That would be useful.

there actually is a couple of ways to determine how far down the stack you are in terms of functions

we just should check if functions name is 'f'

It's a String, not an Array. I actually could not find a duplicate. ( I searched. ) I think reversing a string is very, very slightly just different enough from reversing an array to merit another kata. And I actually liked that people could submit all sorts of different solutions within the limit.

If there were a way to catch f=(s)=>g(s), I'd actually prefer to count body length instead of code length too.

It should be retired, of course.

In fact, it's not new either.

No random tests either .. 2014 and counting ..

This is so 2016 ..

Just do it like everybody else does. I don't really have a problem with it, you can just freeze .toString and cheaters will always find a way, but you have to catch f = s => g(s) with g = unlimited function.

not too sure what the general agreement is now but it's quite easy to 'cheat' at this kata...

Ok, thanks.

It's because we count length of the functions body