Rosetta Code

Longest substrings without repeating characters: Difference between revisions

Page Discussion

Longest substrings without repeating characters (view source)

Revision as of 09:47, 13 October 2023

9 bytes removed ,  7 months ago
→‎{{header|FutureBasic}}
Line 618:
mda_add(0) = mid(t, beg, max)
next
print :@"\n print ," The string: "\"";t;@"\"\n Substring/s: "";
print ,"Substring/s: ";
for c = 0 to mda_count(0) -1
print @""\"";mda(c);@""\" ";
next
print
Jay
68

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/354812"