Really description isn't needed, the test are self-descriptive.

The description should mention which numbers might show up in the note.

Correct me if I am wrong, This does not pass n = 0 test, does it?

The rare tests that don't expect 0 allow sometimes multiple answers.

Nice solution

Nice kata, funny and interesting logical case :)

Python translation kumited :) please check and approve ~~

approved

Ruby translation kumited :) please check and approve ~~

A link to a video is not an excuse for a missing task explanation.

I've seen that most of answers exclude the n==0 check, maybe the test cases were updated

While it's true that this could be approximately twice as fast, the complexity is still the same (constant factors are ignored).

The complexity of this is O(2nlog(n)) because each iteration sorts word. It could be twice as fast (O(nlog(n))) if the sorted word were saved to a variable.