Longest substrings without repeating characters: Difference between revisions

← Older edit

Longest substrings without repeating characters (view source)

Revision as of 16:20, 3 May 2024

2,496 bytes added , 1 month ago

Added Easylang

Chkas

2,058

edits

Revision as of 02:29, 20 May 2023 (view source) Not a robot (talk \| contribs) (Add APL) ← Older edit		Latest revision as of 16:20, 3 May 2024 (view source) Chkas (talk \| contribs) (Added Easylang)
(8 intermediate revisions by 3 users not shown)
Line 372: Original string: '' Longest substrings: <empty></pre> =={{header\|BQN}}== <syntaxhighlight lang="bqn">LongUniq ← ⌈´⊸=∘(≠¨)⊸/ ∧`∘∊⊸/¨∘↓</syntaxhighlight> Alternative: <syntaxhighlight lang="bqn">LongUniq ← ⊢´∘⊔∘(≠¨)⊸⊏ ∊⊸⊐⟜0⊸↑¨∘↓</syntaxhighlight> Test: <syntaxhighlight lang="bqn">LongUniq¨ "a"‿""‿"zzz"‿"xyzyab"‿"xyzyabcybdfd"</syntaxhighlight> {{out}} <pre>┌─ · ⟨ "a" ⟩ ⟨ ⟨⟩ ⟩ ⟨ "z" "z" "z" ⟩ ⟨ "zyab" ⟩ ⟨ "zyabc" "cybdf" ⟩ ┘</pre> =={{header\|C}}== Line 531 ⟶ 542: Longest substring with no repeats found in 'unixdict.txt': ['mbowel disgrunt'] </pre> =={{header\|EasyLang}}== <syntaxhighlight> func$[] longstr s$ . subr maxtest if len sub$ >= max if len sub$ > max max = len sub$ max$[] = [ ] . max$[] &= sub$ . . s$[] = strchars s$ len empty[] 255 len pos[] 255 pos = 1 while pos <= len s$[] c = strcode s$[pos] if pos[c] > 0 maxtest pos = pos[c] + 1 pos[] = empty[] sub$ = "" c = strcode s$[pos] . pos[c] = pos sub$ &= strchar c pos += 1 . maxtest return max$[] . for s$ in [ "xyzyabcybdfd" "xyzyab" "zzzzz" "a" "thisisastringtest" "" ] print longstr s$ . </syntaxhighlight> {{out}} <pre> [ "zyabc" "cybdf" ] [ "zyab" ] [ "z" "z" "z" "z" "z" ] [ "a" ] [ "astring" "ringtes" ] [ "" ] </pre> Line 600 ⟶ 657: > aeiou< </pre> =={{header\|FutureBasic}}== <syntaxhighlight lang="future basic"> local fn substrings( t as CFStringRef ) int beg, c, f, rpt, max = 0 for beg = 0 to len(t) - 1 rpt = instr( beg+1, t, mid(t, beg, 1), NSCaseInsensitiveSearch ) if rpt < 0 then rpt = len(t) c = beg + 1 while c < rpt f = instr(c + 1, t, mid(t, c, 1), NSCaseInsensitiveSearch) if f < 0 then f = len(t) else if f < rpt then rpt = f c++ wend if rpt - beg < max then continue if rpt - beg > max then max = rpt - beg : mda_clear mda_add(0) = mid(t, beg, max) next print @"\n The string: \"";t;@"\"\n Substring/s: "; for c = 0 to mda_count(0) -1 print @"\"";mda(c);@"\" "; next print end fn window 1, @"Longest Substring/s Without Repeated Letters" fn substrings(@"xyzyabcybdfd") fn substrings(@"thisisastringtest") fn substrings(@"My spoon is too big.") fn substrings(@"Rosetta Code") fn substrings(@"AaAaA") fn substrings(@"abcdefghijklmnopqrstuvwxyz") fn substrings(@"aaa aeiou uuu") fn substrings(@"abcdABCD") handleevents </syntaxhighlight> {{out}} [[File:Longest Substrings without Repeated Letters.png]] =={{header\|Go}}== Line 1,411 ⟶ 1,507: =={{header\|Wren}}== {{libheader\|Wren-seq}} <syntaxhighlight lang="~~ecmascript~~wren">import "./seq" for Lst var substrings = Fn.new { \|s\|