Longest substrings without repeating characters: Difference between revisions
Longest substrings without repeating characters (view source)
Revision as of 09:41, 13 October 2023
, 8 months ago→{{header|FutureBasic}}
Line 616:
if rpt - beg < max then continue
if rpt - beg > max then max = rpt - beg : mda_clear
mda_add(0) = mid(t, beg,
next
print : print ," The string: """;t;""""
| |||