Talk:Longest substrings without repeating characters: Difference between revisions

Content added Content deleted

Inline

Revision as of 11:12, 6 September 2021 (view source) Thundergnat (talk \| contribs) m (further evidence) ← Older edit		Revision as of 16:10, 6 September 2021 (view source) Peak (talk \| contribs) (that is the point) Newer edit →
Line 4:		Line 4:

	: 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. --[[User:Thundergnat\|Thundergnat]] ([[User talk:Thundergnat\|talk]]) 11:05, 6 September 2021 (UTC)		: 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. --[[User:Thundergnat\|Thundergnat]] ([[User talk: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.”