Thanks, resolved.

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 ;)

Translated for JavaScript.

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

I updated the description. Thanks for your input.

Good point. That obviously will lead to a game that is no fun. I wonder how I could specify that I don't want that. Is it sufficient to state, that the common symbol between any two cards must not always be the same?

Regarding your constructed bad solution: This is not the question. One can always construct bad solutions.

No, consider this:

              symbol
        1  2  3  4  5  
     1  X  X  -  -  - 
card 2  -  X  X  -  - 
     3  -  -  X  X  -  
     4  -  -  -  X  X 

Card 1 has no common symbol with card 3 and 4

For n n=2 it is not solvable for a set of 2 symbols. So you have to use 3 symbols in total and put s=2 symbols on each of the two cards, so that you're using one of the symbols twice:

	    symbol
        1  2  3  
card 1  X  X  -  
	   2  -  X  X  

Solution: s=2

What makes you think that it is not solvable for n greater than 1?

Yes

I think this is resolved, as both of you sent in working solutions