I'm working on modernizing Rosetta Code's infrastructure. Starting with communications. Please accept this time-limited open invite to RC's Slack.. --Michael Mol (talk) 20:59, 30 May 2020 (UTC)

Talk:Longest substrings without repeating characters

From Rosetta Code

All the longest or a maximally long substring?[edit]

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.”
Ah. Well, you are now becoming acquainted with Calmosoft; the source of large amounts of controversy and extra work for everyone involved with RosettaCode. He doesn't speak English well, (no knock there, he speaks English much better than I speak whatever his native language is) and has a habit of being very vague and even contradictory in his task descriptions. Honestly, I have washed my hands of fixing up his task descriotions since he doesn't invest much effort in coming up with them or maintaining them. If you expect consistency, you will be sorely disappointed.
In such circumstances, anything that satisfies the the description is acceptable as long as you can make a reasonable argument for it. (And honestly, except for possibly a few pedantic sticklers, nobody is going to much care if it doesn't have a reasonable argument.) Again, PLEASE sign your comments. --Thundergnat (talk) 17:18, 6 September 2021 (UTC)