Talk:Longest substrings without repeating characters

From Rosetta Code
Revision as of 16:10, 6 September 2021 by Peak (talk | contribs) (that is the point)

All the longest or a maximally long substring?

The task description does not make it clear whether or not all maximally long substrings should be found. -- Peak

I am not the task author but 'substrings' being plural is a strong hint to me that multiple ones could / should be returned. And, every task entry so far, (jq excluded) including the task authors, returns multiple substrings. BTW, please sign your comments. --Thundergnat (talk) 11:05, 6 September 2021 (UTC)
That is precisely my point, because the page title contradicts the description: “the longest substring without any repeating characters.”