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

Diode in opposite direction?

Will adding a BY-SA image to a blog post make the entire post BY-SA?

How should I respond when I lied about my education and the company finds out through background check?

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

How do I extrude a face to a single vertex

Why is Arduino resetting while driving motors?

Visiting the UK as unmarried couple

What is this type of notehead called?

MAXDOP Settings for SQL Server 2014

Do the concepts of IP address and network interface not belong to the same layer?

How do I implement a file system driver driver in Linux?

Can the Supreme Court overturn an impeachment?

Translation of Scottish 16th century church stained glass

Why did the EU agree to delay the Brexit deadline?

Proving a function is onto where f(x)=|x|.

Can someone explain how this makes sense electrically?

Two-sided logarithm inequality

Journal losing indexing services

Flux received by a negative charge

Can a significant change in incentives void an employment contract?

Difference between -| and |- in TikZ

What linear sensor for a keyboard?

Could the E-bike drivetrain wear down till needing replacement after 400 km?

Is possible to search in vim history?



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.

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









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










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

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









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










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

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









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.

  • 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






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited 9 secs ago







Sara J

















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










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










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




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












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




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










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











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










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











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










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











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










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











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










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











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












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




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













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




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

























                    answered 27 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 14 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

                                Францішак Багушэвіч Змест Сям'я | Біяграфія | Творчасць | Мова Багушэвіча | Ацэнкі дзейнасці | Цікавыя факты | Спадчына | Выбраная бібліяграфія | Ушанаванне памяці | У філатэліі | Зноскі | Літаратура | Спасылкі | НавігацыяЛяхоўскі У. Рупіўся дзеля Бога і людзей: Жыццёвы шлях Лявона Вітан-Дубейкаўскага // Вольскі і Памідораў з песняй пра немца Адвакат, паэт, народны заступнік Ашмянскі веснікВ Минске появится площадь Богушевича и улица Сырокомли, Белорусская деловая газета, 19 июля 2001 г.Айцец беларускай нацыянальнай ідэі паўстаў у бронзе Сяргей Аляксандравіч Адашкевіч (1918, Мінск). 80-я гады. Бюст «Францішак Багушэвіч».Яўген Мікалаевіч Ціхановіч. «Партрэт Францішка Багушэвіча»Мікола Мікалаевіч Купава. «Партрэт зачынальніка новай беларускай літаратуры Францішка Багушэвіча»Уладзімір Іванавіч Мелехаў. На помніку «Змагарам за родную мову» Барэльеф «Францішак Багушэвіч»Памяць пра Багушэвіча на Віленшчыне Страчаная сталіца. Беларускія шыльды на вуліцах Вільні«Krynica». Ideologia i przywódcy białoruskiego katolicyzmuФранцішак БагушэвічТворы на knihi.comТворы Францішка Багушэвіча на bellib.byСодаль Уладзімір. Францішак Багушэвіч на Лідчыне;Луцкевіч Антон. Жыцьцё і творчасьць Фр. Багушэвіча ў успамінах ягоных сучасьнікаў // Запісы Беларускага Навуковага таварыства. Вільня, 1938. Сшытак 1. С. 16-34.Большая российская1188761710000 0000 5537 633Xn9209310021619551927869394п

                                Беларусь Змест Назва Гісторыя Геаграфія Сімволіка Дзяржаўны лад Палітычныя партыі Міжнароднае становішча і знешняя палітыка Адміністрацыйны падзел Насельніцтва Эканоміка Культура і грамадства Сацыяльная сфера Узброеныя сілы Заўвагі Літаратура Спасылкі НавігацыяHGЯOiТоп-2011 г. (па версіі ej.by)Топ-2013 г. (па версіі ej.by)Топ-2016 г. (па версіі ej.by)Топ-2017 г. (па версіі ej.by)Нацыянальны статыстычны камітэт Рэспублікі БеларусьШчыльнасць насельніцтва па краінахhttp://naviny.by/rubrics/society/2011/09/16/ic_articles_116_175144/А. Калечыц, У. Ксяндзоў. Спробы засялення краю неандэртальскім чалавекам.І ў Менску былі мамантыА. Калечыц, У. Ксяндзоў. Старажытны каменны век (палеаліт). Першапачатковае засяленне тэрыторыіГ. Штыхаў. Балты і славяне ў VI—VIII стст.М. Клімаў. Полацкае княства ў IX—XI стст.Г. Штыхаў, В. Ляўко. Палітычная гісторыя Полацкай зямліГ. Штыхаў. Дзяржаўны лад у землях-княствахГ. Штыхаў. Дзяржаўны лад у землях-княствахБеларускія землі ў складзе Вялікага Княства ЛітоўскагаЛюблінская унія 1569 г."The Early Stages of Independence"Zapomniane prawdy25 гадоў таму было аб'яўлена, што Язэп Пілсудскі — беларус (фота)Наша вадаДакументы ЧАЭС: Забруджванне тэрыторыі Беларусі « ЧАЭС Зона адчужэнняСведения о политических партиях, зарегистрированных в Республике Беларусь // Министерство юстиции Республики БеларусьСтатыстычны бюлетэнь „Полаўзроставая структура насельніцтва Рэспублікі Беларусь на 1 студзеня 2012 года і сярэднегадовая колькасць насельніцтва за 2011 год“Индекс человеческого развития Беларуси — не было бы нижеБеларусь занимает первое место в СНГ по индексу развития с учетом гендерного факцёраНацыянальны статыстычны камітэт Рэспублікі БеларусьКанстытуцыя РБ. Артыкул 17Трансфармацыйныя задачы БеларусіВыйсце з крызісу — далейшае рэфармаванне Беларускі рубель — сусветны лідар па дэвальвацыяхПра змену коштаў у кастрычніку 2011 г.Бядней за беларусаў у СНД толькі таджыкіСярэдні заробак у верасні дасягнуў 2,26 мільёна рублёўЭканомікаГаласуем за ТОП-100 беларускай прозыСучасныя беларускія мастакіАрхитектура Беларуси BELARUS.BYА. Каханоўскі. Культура Беларусі ўсярэдзіне XVII—XVIII ст.Анталогія беларускай народнай песні, гуказапісы спеваўБеларускія Музычныя IнструментыБеларускі рок, які мы страцілі. Топ-10 гуртоў«Мясцовы час» — нязгаслая легенда беларускай рок-музыкіСЯРГЕЙ БУДКІН. МЫ НЯ ЗНАЕМ СВАЁЙ МУЗЫКІМ. А. Каладзінскі. НАРОДНЫ ТЭАТРМагнацкія культурныя цэнтрыПублічная дыскусія «Беларуская новая пьеса: без беларускай мовы ці беларуская?»Беларускія драматургі па-ранейшаму лепш ставяцца за мяжой, чым на радзіме«Працэс незалежнага кіно пайшоў, і дзяржаву турбуе яго непадкантрольнасць»Беларускія філосафы ў пошуках прасторыВсе идём в библиотекуАрхіваванаАб Нацыянальнай праграме даследавання і выкарыстання касмічнай прасторы ў мірных мэтах на 2008—2012 гадыУ космас — разам.У суседнім з Барысаўскім раёне пабудуюць Камандна-вымяральны пунктСвяты і абрады беларусаў«Мірныя бульбашы з малой краіны» — 5 непраўдзівых стэрэатыпаў пра БеларусьМ. Раманюк. Беларускае народнае адзеннеУ Беларусі скарачаецца колькасць злачынстваўЛукашэнка незадаволены мінскімі ўладамі Крадзяжы складаюць у Мінску каля 70% злачынстваў Узровень злачыннасці ў Мінскай вобласці — адзін з самых высокіх у краіне Генпракуратура аналізуе стан са злачыннасцю ў Беларусі па каэфіцыенце злачыннасці У Беларусі стабілізавалася крымінагеннае становішча, лічыць генпракурорЗамежнікі сталі здзяйсняць у Беларусі больш злачынстваўМУС Беларусі турбуе рост рэцыдыўнай злачыннасціЯ з ЖЭСа. Дазволіце вас абкрасці! Рэйтынг усіх службаў і падраздзяленняў ГУУС Мінгарвыканкама вырасАб КДБ РБГісторыя Аператыўна-аналітычнага цэнтра РБГісторыя ДКФРТаможняagentura.ruБеларусьBelarus.by — Афіцыйны сайт Рэспублікі БеларусьСайт урада БеларусіRadzima.org — Збор архітэктурных помнікаў, гісторыя Беларусі«Глобус Беларуси»Гербы и флаги БеларусиАсаблівасці каменнага веку на БеларусіА. Калечыц, У. Ксяндзоў. Старажытны каменны век (палеаліт). Першапачатковае засяленне тэрыторыіУ. Ксяндзоў. Сярэдні каменны век (мезаліт). Засяленне краю плямёнамі паляўнічых, рыбакоў і збіральнікаўА. Калечыц, М. Чарняўскі. Плямёны на тэрыторыі Беларусі ў новым каменным веку (неаліце)А. Калечыц, У. Ксяндзоў, М. Чарняўскі. Гаспадарчыя заняткі ў каменным векуЭ. Зайкоўскі. Духоўная культура ў каменным векуАсаблівасці бронзавага веку на БеларусіФарміраванне супольнасцей ранняга перыяду бронзавага векуФотографии БеларусиРоля беларускіх зямель ва ўтварэнні і ўмацаванні ВКЛВ. Фадзеева. З гісторыі развіцця беларускай народнай вышыўкіDMOZGran catalanaБольшая российскаяBritannica (анлайн)Швейцарскі гістарычны15325917611952699xDA123282154079143-90000 0001 2171 2080n9112870100577502ge128882171858027501086026362074122714179пппппп

                                ValueError: Expected n_neighbors <= n_samples, but n_samples = 1, n_neighbors = 6 (SMOTE) The 2019 Stack Overflow Developer Survey Results Are InCan SMOTE be applied over sequence of words (sentences)?ValueError when doing validation with random forestsSMOTE and multi class oversamplingLogic behind SMOTE-NC?ValueError: Error when checking target: expected dense_1 to have shape (7,) but got array with shape (1,)SmoteBoost: Should SMOTE be ran individually for each iteration/tree in the boosting?solving multi-class imbalance classification using smote and OSSUsing SMOTE for Synthetic Data generation to improve performance on unbalanced dataproblem of entry format for a simple model in KerasSVM SMOTE fit_resample() function runs forever with no result