Thanks, I've added an upper bound for n, it should be between 2 and 8 (inclusive).

Looks great to me.

That is true, that upper bound is probably too broad 😅
I have amended the description as suggested and added the performance tag, many thanks.

Thanks for the explanation and tips.
RE: your last point, so would this be appropriate:
Ω(k^n) and O(k!^(k^(n-1))/(k^n))
As we know at worst, they will generate every single de Bruijn sequence and then sort them?
I'll do some more testing anyway and see what I can workout.

Yes, thanks for catching that! I have changed it now.

Thanks!

Is there anyway to preserve older solutions which are now not working purely due to changing the name and importing the solution explicitly?

Thanks, I forgot to change that! I have updated the python initial solution.

Thanks, I have added that fixed test.

Apologies, fixed the typo, should now read:
('01222',2) creates 5 strings ("01,12,22,22,20")
Thanks!

Done, thanks.

Done, thanks.