Talk:Unique characters in each string: Difference between revisions
Content added Content deleted
(more illustrative input) |
No edit summary |
||
Line 6: | Line 6: | ||
I propose using <code>["1a3c52debeffd", "2b6178c97a938sf", "3ycxdb1fgxa2yz"]</code>, since <code>f</code> now meets the above criteria and an intersection no longer produces the correct output. --[[User:Chunes|Chunes]] ([[User talk:Chunes|talk]]) 07:15, 9 May 2021 (UTC) |
I propose using <code>["1a3c52debeffd", "2b6178c97a938sf", "3ycxdb1fgxa2yz"]</code>, since <code>f</code> now meets the above criteria and an intersection no longer produces the correct output. --[[User:Chunes|Chunes]] ([[User talk:Chunes|talk]]) 07:15, 9 May 2021 (UTC) |
||
: I've gone ahead and used the above input in the task proper, before we start getting examples. --[[User:Chunes|Chunes]] ([[User talk:Chunes|talk]]) 07:35, 9 May 2021 (UTC) |
Revision as of 07:36, 9 May 2021
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)