I just gave this thing a cursory glance, and estimate it at least a 5 kyu.
Hopefully easier than it looks?

done

done

you can write console.log() and get the result

n = 2

[60, -120, 60, 60, 60, -120, 60, -120, 60, -120, 60, 60, 60, -120, 60]

several creative ways to do it. nice kata, but appropriate at 5/6 at least for JS.

why result do not the same as in IDLE?! i've solve it in IDLE but here it multiplies my outer list! WTF!

This Kata doesn't work correctly!

the name

python: actual and expected are swapped in the random tests ('cause what's called expected is actually the answer of the user...)

Hi,

there is an issue about the kata, but not about its correctness. Your approach cannot work. What you're designing here is the following:

_/\_ _/\_ _/\_ _/\_ _/\_ _/\_ _/\_...

which is not at all what you're supposed to do.

closing, here, as the proper issue as been raised above.

cheers

python + JS: the sample and fixed tests are just a joke only 2 tests, none testing the recusive aspect. Hence they are actually useless and the user is directly facing a fail on the random tests, with a huge value of n.

=> need more fixed tests ith n from 2 to 4, for example -> n=2 would be enough.

For an example solution, this tramples on quite some best practices.

Ask yourself what you want to showcase.

I liked learning a little about koch curves, but I agree with the other comments that the problem doesn't have enough legs.
One small improvement would be to state that the angle of rotation is defined as positive in the counterclockwise direction.

The function domain is small. I realise there's nothing much to be done because the outputs explode, but that maybe just makes this function less than ideal as a basis for a kata. This invites hardcoding, because it actually is efficient.

JavaScript identifiers should use camelCase ( except for Constructor function names, which this isn't ).

All in all, somewhat satisfied, and unfortunately not likely to be very satisfied without some serious overhauling.