Opportunity taken after all.

changing from unsigned to unsigned long long significantly increases the maximum valid input, and requires only very minor changes to existing code.

Description wasn't updated, but max testing input was.

Problem now is the naive implementation ( sometimes ) passes in time.

LC translation

Ta.

Fork here.

Python, JS and Haskell have permuts(0) -> 1 test.

C needs updated example solution.

Approved with permuts(0)

JS translation

does not yet have permuts(0)

I still see unsigned in the function signature and the description still has "Values up to n = 200 will be tested." ??

( Python, possibly C )

Add a test for permuts(0) -> 1 ( because [] -> [] is valid ).

Or specify n > 0. But that's the chicken way out of course.

this is the same in the Python version, because this kata is a puzzle

fixed

C translation doesn't actually calculate the requested Kata outcome, because the result doesn't fit the unsigned return type.
Either limit the input for the C solution, or use larger return types (or both).