nice

I actually googled "CTE" and that popped up as the first result. So I scrolled down, looking for something else, because surely something medical had to be a false positive - but couldn't find anything else. It's not bad as an inside joke, but can I suggest "concussions" to make it clearer as a joke? It really confused me; normally, in untyped languages, the suggested return value is an example of an actually possible return value.

If you have a nice tests to share, i would gladly add some

CTE - Chronic Traumatic Encephalopathy
Some of the ants for sure will injury themselves, by multiple headbumps.

I fixed the rest :), thanks for the feedback and translation!

Fair enough. 👍

It's all less than ideal. ETA: partially because JS lacks appropriate types, and partially because of questionable design.

The input should have been is a list of enums, the output a list of unsigned ints. The specific encodings of all those don't actually matter all that much.

In JS, String behaves much like an Array of Char, so the input isn't all that bad ( and JS doesn't have Enums ETA: except Booleans actually ). The output would have been much better encoded as some Array though ( and JS doesn't have unsigned ints either ETA: actually, it does, for list elements ).

ETA: ideally, idiomatically, the input would have been an Array of Booleans, and the output an Array of Numbers, or, fancily, an Uint32Array, because anything smaller might would overflow its elements for the N=1e6 case. The input might have been encoded as a ( signed or unsigned ) Int8Array with Left and Right encoded as particular 8-bit numbers ( possibly several; think zero and non-zero ), which would save some storage over said Array of Booleans. Especially for the output, stringifying it is just unnecessary overhead.

Stringification is always suspect; it's not so much an encoding as it is a serialisation, mainly for display-to-human purposes. At least it has decent language support ( in normal languages. in LC, there is none :P ).

Haskell translation

You can add your own testcases. ( I did. )

And yes, there is an O(n) solution.

I think there's a O(2n) or even O(n) solution, but the test cases are not really helpful to verify my ideas.

Nice one to figure out how to solve, a little bit of a riddle.

My pleasure, done.

Rust translation should have signature fn(u32) -> Option<u32>

u32 because it is a positive integer

Option because the operation is fallable (a sentinel value of -1 is frowned upon)

Could you, please, approve this kata?

I made some slight changes to that one. You may want to hit the "reset" button before continueing.