Check my solution regarding that ^^

• Description should be language-agnostic

• Input range should be given

• Notice that any card only has one symbol in common with any other card.

  Perhaps an example would help solvers to understand this requirement better

This is also true for any number n > 1 and n < (intended solution), the question offers no other clues to that.

Thanks, resolved.

the import shouldn't be there in the initial solution for python.

cheers

Translated for TypeScript.

Translated for Python

I have that in my mind. I guess i'll try creating such a kata in the next days. I'll notice it here ;)

Just curious, are you going to expand the idea in this direction? Some time ago I was thinking about creating such kata, just never got to that. I think it would be fun!

Translated for JavaScript.

I like that concise summary. I took it into the description.

just stepping by...

Aren't the requirements to find the "minimal number of symbols to use so that any 2 cards have exactly one symbol in common", actually?

I updated the description. Thanks for your input.

You may say that. But I would also provide a more detailed explanation of this requirement. It is enough to show my s = 2 example for n = 4 and say that such solutions are prohibited because the common symbol is the same for all pairs of cards.