Greatest common substring
$begingroup$
Create a program or function which takes a list of strings as input, and outputs the longest string that is a substring of all input strings. If there are several substrings of equal length, and no longer substring, output any one of them.
- This may mean outputting the empty string.
- If there are several valid outputs, you may output any one of them. You are not required to give consistent outpput for a given input so long as the output is always valid.
- There will always be at least one string in the input, but there might not be a non-empty string.
- All printable ASCII characters may appear in the input. You may assume those are the only characters that appear.
- You may take input or produce output by any of the default methods.
Standard loopholes aren't allowed.- This is code-golf - the fewer bytes of code, the better.
Test cases:
[Inputs] -> [Valid outputs (choose one)]
["hello", "'ello"] -> ["ello"]
["very", "much", "different"] -> [""]
["empty", "", "STRING"] -> [""]
["identical", "identical"] -> ["identical"]
["string", "stRIng"] -> ["st", "ng"]
["this one", "is a substring of this one"] -> ["this one"]
["just one"] -> ["just one"]
["", "", ""] -> [""]
["many outputs", "stuptuo ynam"] -> ["m", "a", "n", "y", " ", "o", "u", "t", "p", "s"]
["many inputs", "any inputs", "ny iii", "yanny"] -> ["ny"]
["%%not&", "ju&#st", "[&]alpha_numeric"] -> ["%"]
code-golf string subsequence
asked 2 hours ago
Sara JSara J
1715
$endgroup$
add a comment |
$begingroup$
Create a program or function which takes a list of strings as input, and outputs the longest string that is a substring of all input strings. If there are several substrings of equal length, and no longer substring, output any one of them.
- This may mean outputting the empty string.
- If there are several valid outputs, you may output any one of them. You are not required to give consistent outpput for a given input so long as the output is always valid.
- There will always be at least one string in the input, but there might not be a non-empty string.
- All printable ASCII characters may appear in the input. You may assume those are the only characters that appear.
- You may take input or produce output by any of the default methods.
Standard loopholes aren't allowed.- This is code-golf - the fewer bytes of code, the better.
Test cases:
[Inputs] -> [Valid outputs (choose one)]
["hello", "'ello"] -> ["ello"]
["very", "much", "different"] -> [""]
["empty", "", "STRING"] -> [""]
["identical", "identical"] -> ["identical"]
["string", "stRIng"] -> ["st", "ng"]
["this one", "is a substring of this one"] -> ["this one"]
["just one"] -> ["just one"]
["", "", ""] -> [""]
["many outputs", "stuptuo ynam"] -> ["m", "a", "n", "y", " ", "o", "u", "t", "p", "s"]
["many inputs", "any inputs", "ny iii", "yanny"] -> ["ny"]
["%%not&", "ju&#st", "[&]alpha_numeric"] -> ["%"]
code-golf string subsequence
asked 2 hours ago
Sara JSara J
1715
$endgroup$
$begingroup$
Possible duplicate
$endgroup$
– Adám
1 hour ago
$begingroup$
@Adám That question asks for the longest common subsequence, not substring.
$endgroup$
– Doorknob♦
1 hour ago
1
$begingroup$
Will the strings be only alphanumeric, or alphabetic, or only printable-ascii?
$endgroup$
– Embodiment of Ignorance
46 mins ago
$begingroup$
@EmbodimentofIgnorance All printable ASCII characters can appear in the input.
$endgroup$
– Sara J
32 mins ago
add a comment |
$begingroup$
Create a program or function which takes a list of strings as input, and outputs the longest string that is a substring of all input strings. If there are several substrings of equal length, and no longer substring, output any one of them.
- This may mean outputting the empty string.
- If there are several valid outputs, you may output any one of them. You are not required to give consistent outpput for a given input so long as the output is always valid.
- There will always be at least one string in the input, but there might not be a non-empty string.
- All printable ASCII characters may appear in the input. You may assume those are the only characters that appear.
- You may take input or produce output by any of the default methods.
Standard loopholes aren't allowed.- This is code-golf - the fewer bytes of code, the better.
Test cases:
[Inputs] -> [Valid outputs (choose one)]
["hello", "'ello"] -> ["ello"]
["very", "much", "different"] -> [""]
["empty", "", "STRING"] -> [""]
["identical", "identical"] -> ["identical"]
["string", "stRIng"] -> ["st", "ng"]
["this one", "is a substring of this one"] -> ["this one"]
["just one"] -> ["just one"]
["", "", ""] -> [""]
["many outputs", "stuptuo ynam"] -> ["m", "a", "n", "y", " ", "o", "u", "t", "p", "s"]
["many inputs", "any inputs", "ny iii", "yanny"] -> ["ny"]
["%%not&", "ju&#st", "[&]alpha_numeric"] -> ["%"]
code-golf string subsequence
asked 2 hours ago
Sara JSara J
1715
$endgroup$
Create a program or function which takes a list of strings as input, and outputs the longest string that is a substring of all input strings. If there are several substrings of equal length, and no longer substring, output any one of them.
- This may mean outputting the empty string.
- If there are several valid outputs, you may output any one of them. You are not required to give consistent outpput for a given input so long as the output is always valid.
- There will always be at least one string in the input, but there might not be a non-empty string.
- All printable ASCII characters may appear in the input. You may assume those are the only characters that appear.
- You may take input or produce output by any of the default methods.
Standard loopholes aren't allowed.- This is code-golf - the fewer bytes of code, the better.
Test cases:
[Inputs] -> [Valid outputs (choose one)]
["hello", "'ello"] -> ["ello"]
["very", "much", "different"] -> [""]
["empty", "", "STRING"] -> [""]
["identical", "identical"] -> ["identical"]
["string", "stRIng"] -> ["st", "ng"]
["this one", "is a substring of this one"] -> ["this one"]
["just one"] -> ["just one"]
["", "", ""] -> [""]
["many outputs", "stuptuo ynam"] -> ["m", "a", "n", "y", " ", "o", "u", "t", "p", "s"]
["many inputs", "any inputs", "ny iii", "yanny"] -> ["ny"]
["%%not&", "ju&#st", "[&]alpha_numeric"] -> ["%"]
code-golf string subsequence
code-golf string subsequence
asked 2 hours ago
Sara JSara J
1715
asked 2 hours ago
Sara JSara J
1715
edited 27 mins ago
Sara J
asked 2 hours ago
Sara JSara J
1715
asked 2 hours ago
Sara JSara J
1715
asked 2 hours ago
Sara JSara J
1715
1715
$begingroup$
Possible duplicate
$endgroup$
– Adám
1 hour ago
$begingroup$
@Adám That question asks for the longest common subsequence, not substring.
$endgroup$
– Doorknob♦
1 hour ago
1
$begingroup$
Will the strings be only alphanumeric, or alphabetic, or only printable-ascii?
$endgroup$
– Embodiment of Ignorance
46 mins ago
$begingroup$
@EmbodimentofIgnorance All printable ASCII characters can appear in the input.
$endgroup$
– Sara J
32 mins ago
add a comment |
$begingroup$
Possible duplicate
$endgroup$
– Adám
1 hour ago
$begingroup$
@Adám That question asks for the longest common subsequence, not substring.
$endgroup$
– Doorknob♦
1 hour ago
1
$begingroup$
Will the strings be only alphanumeric, or alphabetic, or only printable-ascii?
$endgroup$
– Embodiment of Ignorance
46 mins ago
$begingroup$
@EmbodimentofIgnorance All printable ASCII characters can appear in the input.
$endgroup$
– Sara J
32 mins ago
$begingroup$
Possible duplicate
$endgroup$
– Adám
1 hour ago
$begingroup$
Possible duplicate
$endgroup$
– Adám
1 hour ago
$begingroup$
@Adám That question asks for the longest common subsequence, not substring.
$endgroup$
– Doorknob♦
1 hour ago
$begingroup$
@Adám That question asks for the longest common subsequence, not substring.
$endgroup$
– Doorknob♦
1 hour ago
1
1
$begingroup$
Will the strings be only alphanumeric, or alphabetic, or only printable-ascii?
$endgroup$
– Embodiment of Ignorance
46 mins ago
$begingroup$
Will the strings be only alphanumeric, or alphabetic, or only printable-ascii?
$endgroup$
– Embodiment of Ignorance
46 mins ago
$begingroup$
@EmbodimentofIgnorance All printable ASCII characters can appear in the input.
$endgroup$
– Sara J
32 mins ago
$begingroup$
@EmbodimentofIgnorance All printable ASCII characters can appear in the input.
$endgroup$
– Sara J
32 mins ago
add a comment |
4 Answers
4
active
oldest
votes
$begingroup$
Jelly, 12 bytes
Ẇ€œ&/LÐṀḢ¹L?
Try it online!
Last four bytes are there because of the requirement to only output one answer.
answered 1 hour ago
Nick KennedyNick Kennedy
92147
$endgroup$
add a comment |
$begingroup$
JavaScript (Node.js), 114 105 bytes
a=>(F=(l,n,w=a[0].substr(n,l))=>l?n<0?F(--l,L-l):a.some(y=>y.search(w)<0)?F(l,n-1):w:"")(L=a[0].length,0)
Try it online!
Probably still golfable.
y.indexOf must be used in place of y.search if the strings may contain special regex characters, at the cost of 1 more byte.
answered 55 mins ago
Shieru AsakotoShieru Asakoto
2,750317
$endgroup$
add a comment |
$begingroup$
Brachylog (v2), 3 bytes
sᵛw
Try it online!
Full program. Input from standard input (as a JSON-style list of strings), output to standard output.
Explanation
sᵛw
s Find a substring
ᵛ of every element {of the input}; the same one for each
w and output it.
Tiebreak order here is set by the s, favouring the longest substring (the secondary tiebreak doesn't matter, but IIRC it's position within the first element of the input).
Brachylog's s doesn't return empty substrings, so we need a bit of a trick to get around that: instead of making a function submission (which is what's normally done), we write a full program, outputting to standard output. That way, if there's a common substring, we just output it, and we're done. If there isn't a common substring, the program errors out – but it still prints nothing to standard output, thus it outputs the null string as intended.
$endgroup$
add a comment |
$begingroup$
Python 3, 137 bytes
def a(b):c=[[d[f:e]for e in range(len(d)+1)for f in range(e+1)]for d in b];return max([i for i in c[0]if all(i in j for j in c)],key=len)
Try it online!
answered 1 hour ago
Artemis FowlArtemis Fowl
1013
New contributor
Artemis Fowl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
$begingroup$
You may want to use single spaces as indentation instead of 4 that seems to shave more than 100 bytes.
$endgroup$
– Shieru Asakoto
1 hour ago
$begingroup$
@ShieruAsakoto Oops yeah.
$endgroup$
– Artemis Fowl
1 hour ago
$begingroup$
135 bytes by simplifying thecdeclaration and condensing theforloop. I would recommend adding the title and bytecount to the header, or using TIO's formatter to create the body of your post
$endgroup$
– Jo King
46 mins ago
$begingroup$
@JoKing tio.run/…
$endgroup$
– Artemis Fowl
23 mins ago
$begingroup$
@JoKing The one currently in my answer is fine for all the test cases.
$endgroup$
– Artemis Fowl
18 mins ago
|
show 1 more comment
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "200"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f182134%2fgreatest-common-substring%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Jelly, 12 bytes
Ẇ€œ&/LÐṀḢ¹L?
Try it online!
Last four bytes are there because of the requirement to only output one answer.
answered 1 hour ago
Nick KennedyNick Kennedy
92147
$endgroup$
add a comment |
$begingroup$
Jelly, 12 bytes
Ẇ€œ&/LÐṀḢ¹L?
Try it online!
Last four bytes are there because of the requirement to only output one answer.
answered 1 hour ago
Nick KennedyNick Kennedy
92147
$endgroup$
add a comment |
$begingroup$
Jelly, 12 bytes
Ẇ€œ&/LÐṀḢ¹L?
Try it online!
Last four bytes are there because of the requirement to only output one answer.
answered 1 hour ago
Nick KennedyNick Kennedy
92147
$endgroup$
Jelly, 12 bytes
Ẇ€œ&/LÐṀḢ¹L?
Try it online!
Last four bytes are there because of the requirement to only output one answer.
answered 1 hour ago
Nick KennedyNick Kennedy
92147
answered 1 hour ago
Nick KennedyNick Kennedy
92147
answered 1 hour ago
Nick KennedyNick Kennedy
92147
answered 1 hour ago
Nick KennedyNick Kennedy
92147
92147
add a comment |
add a comment |
$begingroup$
JavaScript (Node.js), 114 105 bytes
a=>(F=(l,n,w=a[0].substr(n,l))=>l?n<0?F(--l,L-l):a.some(y=>y.search(w)<0)?F(l,n-1):w:"")(L=a[0].length,0)
Try it online!
Probably still golfable.
y.indexOf must be used in place of y.search if the strings may contain special regex characters, at the cost of 1 more byte.
answered 55 mins ago
Shieru AsakotoShieru Asakoto
2,750317
$endgroup$
add a comment |
$begingroup$
JavaScript (Node.js), 114 105 bytes
a=>(F=(l,n,w=a[0].substr(n,l))=>l?n<0?F(--l,L-l):a.some(y=>y.search(w)<0)?F(l,n-1):w:"")(L=a[0].length,0)
Try it online!
Probably still golfable.
y.indexOf must be used in place of y.search if the strings may contain special regex characters, at the cost of 1 more byte.
answered 55 mins ago
Shieru AsakotoShieru Asakoto
2,750317
$endgroup$
add a comment |
$begingroup$
JavaScript (Node.js), 114 105 bytes
a=>(F=(l,n,w=a[0].substr(n,l))=>l?n<0?F(--l,L-l):a.some(y=>y.search(w)<0)?F(l,n-1):w:"")(L=a[0].length,0)
Try it online!
Probably still golfable.
y.indexOf must be used in place of y.search if the strings may contain special regex characters, at the cost of 1 more byte.
answered 55 mins ago
Shieru AsakotoShieru Asakoto
2,750317
$endgroup$
JavaScript (Node.js), 114 105 bytes
a=>(F=(l,n,w=a[0].substr(n,l))=>l?n<0?F(--l,L-l):a.some(y=>y.search(w)<0)?F(l,n-1):w:"")(L=a[0].length,0)
Try it online!
Probably still golfable.
y.indexOf must be used in place of y.search if the strings may contain special regex characters, at the cost of 1 more byte.
answered 55 mins ago
Shieru AsakotoShieru Asakoto
2,750317
edited 45 mins ago
answered 55 mins ago
Shieru AsakotoShieru Asakoto
2,750317
answered 55 mins ago
Shieru AsakotoShieru Asakoto
2,750317
answered 55 mins ago
Shieru AsakotoShieru Asakoto
2,750317
2,750317
add a comment |
add a comment |
$begingroup$
Brachylog (v2), 3 bytes
sᵛw
Try it online!
Full program. Input from standard input (as a JSON-style list of strings), output to standard output.
Explanation
sᵛw
s Find a substring
ᵛ of every element {of the input}; the same one for each
w and output it.
Tiebreak order here is set by the s, favouring the longest substring (the secondary tiebreak doesn't matter, but IIRC it's position within the first element of the input).
Brachylog's s doesn't return empty substrings, so we need a bit of a trick to get around that: instead of making a function submission (which is what's normally done), we write a full program, outputting to standard output. That way, if there's a common substring, we just output it, and we're done. If there isn't a common substring, the program errors out – but it still prints nothing to standard output, thus it outputs the null string as intended.
$endgroup$
add a comment |
$begingroup$
Brachylog (v2), 3 bytes
sᵛw
Try it online!
Full program. Input from standard input (as a JSON-style list of strings), output to standard output.
Explanation
sᵛw
s Find a substring
ᵛ of every element {of the input}; the same one for each
w and output it.
Tiebreak order here is set by the s, favouring the longest substring (the secondary tiebreak doesn't matter, but IIRC it's position within the first element of the input).
Brachylog's s doesn't return empty substrings, so we need a bit of a trick to get around that: instead of making a function submission (which is what's normally done), we write a full program, outputting to standard output. That way, if there's a common substring, we just output it, and we're done. If there isn't a common substring, the program errors out – but it still prints nothing to standard output, thus it outputs the null string as intended.
$endgroup$
add a comment |
$begingroup$
Brachylog (v2), 3 bytes
sᵛw
Try it online!
Full program. Input from standard input (as a JSON-style list of strings), output to standard output.
Explanation
sᵛw
s Find a substring
ᵛ of every element {of the input}; the same one for each
w and output it.
Tiebreak order here is set by the s, favouring the longest substring (the secondary tiebreak doesn't matter, but IIRC it's position within the first element of the input).
Brachylog's s doesn't return empty substrings, so we need a bit of a trick to get around that: instead of making a function submission (which is what's normally done), we write a full program, outputting to standard output. That way, if there's a common substring, we just output it, and we're done. If there isn't a common substring, the program errors out – but it still prints nothing to standard output, thus it outputs the null string as intended.
$endgroup$
Brachylog (v2), 3 bytes
sᵛw
Try it online!
Full program. Input from standard input (as a JSON-style list of strings), output to standard output.
Explanation
sᵛw
s Find a substring
ᵛ of every element {of the input}; the same one for each
w and output it.
Tiebreak order here is set by the s, favouring the longest substring (the secondary tiebreak doesn't matter, but IIRC it's position within the first element of the input).
Brachylog's s doesn't return empty substrings, so we need a bit of a trick to get around that: instead of making a function submission (which is what's normally done), we write a full program, outputting to standard output. That way, if there's a common substring, we just output it, and we're done. If there isn't a common substring, the program errors out – but it still prints nothing to standard output, thus it outputs the null string as intended.
answered 42 mins ago
community wiki
ais523
add a comment |
add a comment |
$begingroup$
Python 3, 137 bytes
def a(b):c=[[d[f:e]for e in range(len(d)+1)for f in range(e+1)]for d in b];return max([i for i in c[0]if all(i in j for j in c)],key=len)
Try it online!
answered 1 hour ago
Artemis FowlArtemis Fowl
1013
New contributor
Artemis Fowl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
$begingroup$
You may want to use single spaces as indentation instead of 4 that seems to shave more than 100 bytes.
$endgroup$
– Shieru Asakoto
1 hour ago
$begingroup$
@ShieruAsakoto Oops yeah.
$endgroup$
– Artemis Fowl
1 hour ago
$begingroup$
135 bytes by simplifying thecdeclaration and condensing theforloop. I would recommend adding the title and bytecount to the header, or using TIO's formatter to create the body of your post
$endgroup$
– Jo King
46 mins ago
$begingroup$
@JoKing tio.run/…
$endgroup$
– Artemis Fowl
23 mins ago
$begingroup$
@JoKing The one currently in my answer is fine for all the test cases.
$endgroup$
– Artemis Fowl
18 mins ago
|
show 1 more comment
$begingroup$
Python 3, 137 bytes
def a(b):c=[[d[f:e]for e in range(len(d)+1)for f in range(e+1)]for d in b];return max([i for i in c[0]if all(i in j for j in c)],key=len)
Try it online!
answered 1 hour ago
Artemis FowlArtemis Fowl
1013
New contributor
Artemis Fowl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
$begingroup$
You may want to use single spaces as indentation instead of 4 that seems to shave more than 100 bytes.
$endgroup$
– Shieru Asakoto
1 hour ago
$begingroup$
@ShieruAsakoto Oops yeah.
$endgroup$
– Artemis Fowl
1 hour ago
$begingroup$
135 bytes by simplifying thecdeclaration and condensing theforloop. I would recommend adding the title and bytecount to the header, or using TIO's formatter to create the body of your post
$endgroup$
– Jo King
46 mins ago
$begingroup$
@JoKing tio.run/…
$endgroup$
– Artemis Fowl
23 mins ago
$begingroup$
@JoKing The one currently in my answer is fine for all the test cases.
$endgroup$
– Artemis Fowl
18 mins ago
|
show 1 more comment
$begingroup$
Python 3, 137 bytes
def a(b):c=[[d[f:e]for e in range(len(d)+1)for f in range(e+1)]for d in b];return max([i for i in c[0]if all(i in j for j in c)],key=len)
Try it online!
answered 1 hour ago
Artemis FowlArtemis Fowl
1013
New contributor
Artemis Fowl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
Python 3, 137 bytes
def a(b):c=[[d[f:e]for e in range(len(d)+1)for f in range(e+1)]for d in b];return max([i for i in c[0]if all(i in j for j in c)],key=len)
Try it online!
answered 1 hour ago
Artemis FowlArtemis Fowl
1013
New contributor
Artemis Fowl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 14 mins ago
answered 1 hour ago
Artemis FowlArtemis Fowl
1013
New contributor
Artemis Fowl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
answered 1 hour ago
Artemis FowlArtemis Fowl
1013
answered 1 hour ago
Artemis FowlArtemis Fowl
1013
1013
New contributor
Artemis Fowl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Artemis Fowl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Artemis Fowl is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$begingroup$
You may want to use single spaces as indentation instead of 4 that seems to shave more than 100 bytes.
$endgroup$
– Shieru Asakoto
1 hour ago
$begingroup$
@ShieruAsakoto Oops yeah.
$endgroup$
– Artemis Fowl
1 hour ago
$begingroup$
135 bytes by simplifying thecdeclaration and condensing theforloop. I would recommend adding the title and bytecount to the header, or using TIO's formatter to create the body of your post
$endgroup$
– Jo King
46 mins ago
$begingroup$
@JoKing tio.run/…
$endgroup$
– Artemis Fowl
23 mins ago
$begingroup$
@JoKing The one currently in my answer is fine for all the test cases.
$endgroup$
– Artemis Fowl
18 mins ago
|
show 1 more comment
$begingroup$
You may want to use single spaces as indentation instead of 4 that seems to shave more than 100 bytes.
$endgroup$
– Shieru Asakoto
1 hour ago
$begingroup$
@ShieruAsakoto Oops yeah.
$endgroup$
– Artemis Fowl
1 hour ago
$begingroup$
135 bytes by simplifying thecdeclaration and condensing theforloop. I would recommend adding the title and bytecount to the header, or using TIO's formatter to create the body of your post
$endgroup$
– Jo King
46 mins ago
$begingroup$
@JoKing tio.run/…
$endgroup$
– Artemis Fowl
23 mins ago
$begingroup$
@JoKing The one currently in my answer is fine for all the test cases.
$endgroup$
– Artemis Fowl
18 mins ago
$begingroup$
You may want to use single spaces as indentation instead of 4 that seems to shave more than 100 bytes.
$endgroup$
– Shieru Asakoto
1 hour ago
$begingroup$
You may want to use single spaces as indentation instead of 4 that seems to shave more than 100 bytes.
$endgroup$
– Shieru Asakoto
1 hour ago
$begingroup$
@ShieruAsakoto Oops yeah.
$endgroup$
– Artemis Fowl
1 hour ago
$begingroup$
@ShieruAsakoto Oops yeah.
$endgroup$
– Artemis Fowl
1 hour ago
$begingroup$
135 bytes by simplifying the
c declaration and condensing the for loop. I would recommend adding the title and bytecount to the header, or using TIO's formatter to create the body of your post$endgroup$
– Jo King
46 mins ago
$begingroup$
135 bytes by simplifying the
c declaration and condensing the for loop. I would recommend adding the title and bytecount to the header, or using TIO's formatter to create the body of your post$endgroup$
– Jo King
46 mins ago
$begingroup$
@JoKing tio.run/…
$endgroup$
– Artemis Fowl
23 mins ago
$begingroup$
@JoKing tio.run/…
$endgroup$
– Artemis Fowl
23 mins ago
$begingroup$
@JoKing The one currently in my answer is fine for all the test cases.
$endgroup$
– Artemis Fowl
18 mins ago
$begingroup$
@JoKing The one currently in my answer is fine for all the test cases.
$endgroup$
– Artemis Fowl
18 mins ago
|
show 1 more comment
If this is an answer to a challenge…
…Be sure to follow the challenge specification. However, please refrain from exploiting obvious loopholes. Answers abusing any of the standard loopholes are considered invalid. If you think a specification is unclear or underspecified, comment on the question instead.
…Try to optimize your score. For instance, answers to code-golf challenges should attempt to be as short as possible. You can always include a readable version of the code in addition to the competitive one.
Explanations of your answer make it more interesting to read and are very much encouraged.…Include a short header which indicates the language(s) of your code and its score, as defined by the challenge.
More generally…
…Please make sure to answer the question and provide sufficient detail.
…Avoid asking for help, clarification or responding to other answers (use comments instead).
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f182134%2fgreatest-common-substring%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
Possible duplicate
$endgroup$
– Adám
1 hour ago
$begingroup$
@Adám That question asks for the longest common subsequence, not substring.
$endgroup$
– Doorknob♦
1 hour ago
1
$begingroup$
Will the strings be only alphanumeric, or alphabetic, or only printable-ascii?
$endgroup$
– Embodiment of Ignorance
46 mins ago
$begingroup$
@EmbodimentofIgnorance All printable ASCII characters can appear in the input.
$endgroup$
– Sara J
32 mins ago