Longest substrings without repeating characters: Difference between revisions
Longest substrings without repeating characters (view source)
Revision as of 09:28, 13 October 2023
, 7 months ago→{{header|FutureBasic}}
Line 603:
=={{header|FutureBasic}}==
<syntaxhighlight lang="future basic">
local fn substrings(
int beg, c, f, rpt, max = 0
for beg = 0 to len(t)//-1
Line 640:
{{out}}
[[File:Longest Substrings without Repeated Letters.png]]
=={{header|Go}}==
{{trans|Wren}}
|