Talk:Unique characters in each string

From Rosetta Code
Revision as of 07:15, 9 May 2021 by Chunes (talk | contribs) (more illustrative input)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Input?

I suggest using an input that illustrates the problem more closely. As it stands, taking the intersection yields the correct output because there aren't any characters that

  • repeat multiple times within a single string
  • are present in all strings


I propose using ["1a3c52debeffd", "2b6178c97a938sf", "3ycxdb1fgxa2yz"], since f now meets the above criteria and an intersection no longer produces the correct output. --Chunes (talk) 07:15, 9 May 2021 (UTC)