Fixed.

Same for me, keeps timing out

Default solution should be fixed now.

Not sure how this would be considered best pratice. Several checks that are not needed.

any hint ?

@AlexIsHappy: Don't use headings to create bold text. Instead, create a short heading (e.g. # Task) and add the text after the heading.

Thank you very much for your remarks! I'll fix them ASAP)

Two major problems:

1. Sample test cases are all named Test2 (except for the one method named Test1) so they do not run.
2. Input to function is int, but last two sample test cases pass a long, meaning they don't run

Sometimes it's "submission timeout," but once I get past that, all the tests pass but it says "process terminated (took greater than 6000ms)" or something like that. Testing n=max in visual studio, my solution indeed takes longer than 6 seconds to finish. My function is O(n), purely arithmetic.

A suggestion for improvement: change the "n" parameter to ushort and thus restrict input to the bounds of a 16-bit unsigned integer.

As long as briman0094 hasn't said whether it's a submission timeout (Codewars' fault) or a process timeout (tests take too long), I would wait.

So you are suggesting that I have to remove some of the test?

I rewrote my algorithm to not even use any sort of data structure but rather use math to figure out the name, and it still times out. It passes more tests than before, but it still times out. The test cases are too restrictive on the solution and cause this Kata to be too close-ended.

Keeps timing out for me, when the code runs fine in Visual Studio. Not sure if the site's busy or a test case is faulty, but it won't work.

Done! Thanks for explaining! Obviously, I have to think about more clear instructions next time! If you are interested, check out my last kata. Is it getting any better?

Oh thanks ! I was wondering how I can make my description looks a little better!