Greatest common substringShortest Longest Common Subsequence CodeFinding “sub-palindromes” 2: subsequences.Decompose a StringFind Patterns in StringsShortest Longest Common Subsequence CodeMaximal Substring ConstructionVisualize the greatest common divisorShortest Unique SubstringFind the original string, without the repetition without the repetition in the middleMinimal Fresh SubstringsStitch Together a Palindrome from Palindromic Substrings

Drawing a topological "handle" with Tikz

Divine apple island

Did arcade monitors have same pixel aspect ratio as TV sets?

What is this type of notehead called?

Why did the HMS Bounty go back to a time when whales are already rare?

Why did the EU agree to delay the Brexit deadline?

Can a significant change in incentives void an employment contract?

Is it possible to have a strip of cold climate in the middle of a planet?

What is the gram­mat­i­cal term for “‑ed” words like these?

Greatest common substring

Have I saved too much for retirement so far?

Customize circled numbers

Should I stop contributing to retirement accounts?

How will losing mobility of one hand affect my career as a programmer?

A social experiment. What is the worst that can happen?

List of people who lose a child in תנ"ך

Can someone explain how this makes sense electrically?

What linear sensor for a keyboard?

Greco-Roman egalitarianism

Is XSS in canonical link possible?

Some numbers are more equivalent than others

Global amount of publications over time

Is there a word to describe the feeling of being transfixed out of horror?

Transformation of random variables and joint distributions



Greatest common substring


Shortest Longest Common Subsequence CodeFinding “sub-palindromes” 2: subsequences.Decompose a StringFind Patterns in StringsShortest Longest Common Subsequence CodeMaximal Substring ConstructionVisualize the greatest common divisorShortest Unique SubstringFind the original string, without the repetition without the repetition in the middleMinimal Fresh SubstringsStitch Together a Palindrome from Palindromic Substrings













4












$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.

  • 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"]









share|improve this question









$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
    15 mins ago










  • $begingroup$
    @EmbodimentofIgnorance All printable ASCII characters can appear in the input.
    $endgroup$
    – Sara J
    1 min ago















4












$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.

  • 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"]









share|improve this question









$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
    15 mins ago










  • $begingroup$
    @EmbodimentofIgnorance All printable ASCII characters can appear in the input.
    $endgroup$
    – Sara J
    1 min ago













4












4








4





$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.

  • 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"]









share|improve this question









$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.

  • 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"]






code-golf string subsequence






share|improve this question













share|improve this question











share|improve this question




share|improve this question










asked 1 hour 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
    15 mins ago










  • $begingroup$
    @EmbodimentofIgnorance All printable ASCII characters can appear in the input.
    $endgroup$
    – Sara J
    1 min 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






  • 1




    $begingroup$
    Will the strings be only alphanumeric, or alphabetic, or only printable-ascii?
    $endgroup$
    – Embodiment of Ignorance
    15 mins ago










  • $begingroup$
    @EmbodimentofIgnorance All printable ASCII characters can appear in the input.
    $endgroup$
    – Sara J
    1 min 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
15 mins ago




$begingroup$
Will the strings be only alphanumeric, or alphabetic, or only printable-ascii?
$endgroup$
– Embodiment of Ignorance
15 mins ago












$begingroup$
@EmbodimentofIgnorance All printable ASCII characters can appear in the input.
$endgroup$
– Sara J
1 min ago




$begingroup$
@EmbodimentofIgnorance All printable ASCII characters can appear in the input.
$endgroup$
– Sara J
1 min ago










4 Answers
4






active

oldest

votes


















0












$begingroup$


Jelly, 12 bytes



Ẇ€œ&/LÐṀḢ¹L?


Try it online!



Last four bytes are there because of the requirement to only output one answer.






share|improve this answer









$endgroup$




















    0












    $begingroup$

    Not golfed it much yet but here's my Python 3 answer at 354 bytes:

    EDIT: Now 238 bytes with one space indents and some one-line iterators:

    EDIT: 193 bytes with max function

    EDIT: 189 bytes removed unnecessary list



    def a(b):
    a=();c=list(sum(list(list(d[f:e]for f in range(e))for e in range(len(d)+1)),[])for d in b)
    for i in c[0]:
    if all(i in j for j in c):
    a+=(i,)
    return max(a,key=len)





    share|improve this answer










    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
      51 mins ago










    • $begingroup$
      @ShieruAsakoto Oops yeah.
      $endgroup$
      – Artemis Fowl
      44 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
      15 mins ago











    • $begingroup$
      102 bytes by using set operators instead
      $endgroup$
      – Jo King
      11 mins ago


















    0












    $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.






    share|improve this answer











    $endgroup$




















      0












      $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.






      share|improve this answer











      $endgroup$












        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
        );



        );













        draft saved

        draft discarded


















        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









        0












        $begingroup$


        Jelly, 12 bytes



        Ẇ€œ&/LÐṀḢ¹L?


        Try it online!



        Last four bytes are there because of the requirement to only output one answer.






        share|improve this answer









        $endgroup$

















          0












          $begingroup$


          Jelly, 12 bytes



          Ẇ€œ&/LÐṀḢ¹L?


          Try it online!



          Last four bytes are there because of the requirement to only output one answer.






          share|improve this answer









          $endgroup$















            0












            0








            0





            $begingroup$


            Jelly, 12 bytes



            Ẇ€œ&/LÐṀḢ¹L?


            Try it online!



            Last four bytes are there because of the requirement to only output one answer.






            share|improve this answer









            $endgroup$




            Jelly, 12 bytes



            Ẇ€œ&/LÐṀḢ¹L?


            Try it online!



            Last four bytes are there because of the requirement to only output one answer.







            share|improve this answer












            share|improve this answer



            share|improve this answer










            answered 1 hour ago









            Nick KennedyNick Kennedy

            92147




            92147





















                0












                $begingroup$

                Not golfed it much yet but here's my Python 3 answer at 354 bytes:

                EDIT: Now 238 bytes with one space indents and some one-line iterators:

                EDIT: 193 bytes with max function

                EDIT: 189 bytes removed unnecessary list



                def a(b):
                a=();c=list(sum(list(list(d[f:e]for f in range(e))for e in range(len(d)+1)),[])for d in b)
                for i in c[0]:
                if all(i in j for j in c):
                a+=(i,)
                return max(a,key=len)





                share|improve this answer










                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
                  51 mins ago










                • $begingroup$
                  @ShieruAsakoto Oops yeah.
                  $endgroup$
                  – Artemis Fowl
                  44 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
                  15 mins ago











                • $begingroup$
                  102 bytes by using set operators instead
                  $endgroup$
                  – Jo King
                  11 mins ago















                0












                $begingroup$

                Not golfed it much yet but here's my Python 3 answer at 354 bytes:

                EDIT: Now 238 bytes with one space indents and some one-line iterators:

                EDIT: 193 bytes with max function

                EDIT: 189 bytes removed unnecessary list



                def a(b):
                a=();c=list(sum(list(list(d[f:e]for f in range(e))for e in range(len(d)+1)),[])for d in b)
                for i in c[0]:
                if all(i in j for j in c):
                a+=(i,)
                return max(a,key=len)





                share|improve this answer










                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
                  51 mins ago










                • $begingroup$
                  @ShieruAsakoto Oops yeah.
                  $endgroup$
                  – Artemis Fowl
                  44 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
                  15 mins ago











                • $begingroup$
                  102 bytes by using set operators instead
                  $endgroup$
                  – Jo King
                  11 mins ago













                0












                0








                0





                $begingroup$

                Not golfed it much yet but here's my Python 3 answer at 354 bytes:

                EDIT: Now 238 bytes with one space indents and some one-line iterators:

                EDIT: 193 bytes with max function

                EDIT: 189 bytes removed unnecessary list



                def a(b):
                a=();c=list(sum(list(list(d[f:e]for f in range(e))for e in range(len(d)+1)),[])for d in b)
                for i in c[0]:
                if all(i in j for j in c):
                a+=(i,)
                return max(a,key=len)





                share|improve this answer










                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$



                Not golfed it much yet but here's my Python 3 answer at 354 bytes:

                EDIT: Now 238 bytes with one space indents and some one-line iterators:

                EDIT: 193 bytes with max function

                EDIT: 189 bytes removed unnecessary list



                def a(b):
                a=();c=list(sum(list(list(d[f:e]for f in range(e))for e in range(len(d)+1)),[])for d in b)
                for i in c[0]:
                if all(i in j for j in c):
                a+=(i,)
                return max(a,key=len)






                share|improve this answer










                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.









                share|improve this answer



                share|improve this answer








                edited 19 mins ago





















                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 55 mins 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
                  51 mins ago










                • $begingroup$
                  @ShieruAsakoto Oops yeah.
                  $endgroup$
                  – Artemis Fowl
                  44 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
                  15 mins ago











                • $begingroup$
                  102 bytes by using set operators instead
                  $endgroup$
                  – Jo King
                  11 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
                  51 mins ago










                • $begingroup$
                  @ShieruAsakoto Oops yeah.
                  $endgroup$
                  – Artemis Fowl
                  44 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
                  15 mins ago











                • $begingroup$
                  102 bytes by using set operators instead
                  $endgroup$
                  – Jo King
                  11 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
                51 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
                51 mins ago












                $begingroup$
                @ShieruAsakoto Oops yeah.
                $endgroup$
                – Artemis Fowl
                44 mins ago




                $begingroup$
                @ShieruAsakoto Oops yeah.
                $endgroup$
                – Artemis Fowl
                44 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
                15 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
                15 mins ago













                $begingroup$
                102 bytes by using set operators instead
                $endgroup$
                – Jo King
                11 mins ago




                $begingroup$
                102 bytes by using set operators instead
                $endgroup$
                – Jo King
                11 mins ago











                0












                $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.






                share|improve this answer











                $endgroup$

















                  0












                  $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.






                  share|improve this answer











                  $endgroup$















                    0












                    0








                    0





                    $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.






                    share|improve this answer











                    $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.







                    share|improve this answer














                    share|improve this answer



                    share|improve this answer








                    edited 14 mins ago

























                    answered 24 mins ago









                    Shieru AsakotoShieru Asakoto

                    2,750317




                    2,750317





















                        0












                        $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.






                        share|improve this answer











                        $endgroup$

















                          0












                          $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.






                          share|improve this answer











                          $endgroup$















                            0












                            0








                            0





                            $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.






                            share|improve this answer











                            $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.







                            share|improve this answer














                            share|improve this answer



                            share|improve this answer








                            answered 11 mins ago


























                            community wiki





                            ais523




























                                draft saved

                                draft discarded
















































                                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).




                                draft saved


                                draft discarded














                                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





















































                                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







                                Popular posts from this blog

                                Möglingen Índice Localización Historia Demografía Referencias Enlaces externos Menú de navegación48°53′18″N 9°07′45″E / 48.888333333333, 9.129166666666748°53′18″N 9°07′45″E / 48.888333333333, 9.1291666666667Sitio web oficial Mapa de Möglingen«Gemeinden in Deutschland nach Fläche, Bevölkerung und Postleitzahl am 30.09.2016»Möglingen

                                Virtualbox - Configuration error: Querying “UUID” failed (VERR_CFGM_VALUE_NOT_FOUND)“VERR_SUPLIB_WORLD_WRITABLE” error when trying to installing OS in virtualboxVirtual Box Kernel errorFailed to open a seesion for the virtual machineFailed to open a session for the virtual machineUbuntu 14.04 LTS Virtualbox errorcan't use VM VirtualBoxusing virtualboxI can't run Linux-64 Bit on VirtualBoxUnable to insert the virtual optical disk (VBoxguestaddition) in virtual machine for ubuntu server in win 10VirtuaBox in Ubuntu 18.04 Issues with Win10.ISO Installation

                                Torre de la Isleta Índice Véase también Referencias Bibliografía Enlaces externos Menú de navegación38°25′58″N 0°23′02″O / 38.43277778, -0.3838888938°25′58″N 0°23′02″O / 38.43277778, -0.38388889Torre de la Illeta de l’Horta o Torre Saleta. Base de datos de bienes inmuebles. Patrimonio Cultural. Secretaría de Estado de CulturaFicha BIC Torre de la Illeta de l’Horta. Dirección General de Patrimonio Cultural. Generalitat ValencianaLugares de interés. Ayuntamiento del CampelloTorre de la Isleta en CastillosNet.org