Greatest common substringShortest Longest Common Subsequence CodeFinding “sub-palindromes” 2:...

What is this type of notehead called?

Find last 3 digits of this monster number

Why do IPv6 unique local addresses have to have a /48 prefix?

Transformation of random variables and joint distributions

Has Darkwing Duck ever met Scrooge McDuck?

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

Reply 'no position' while the job posting is still there

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

Should I stop contributing to retirement accounts?

Bob has never been a M before

Is there a conventional notation or name for the slip angle?

Visiting the UK as unmarried couple

How can "mimic phobia" be cured or prevented?

Freedom of speech and where it applies

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?

Is it better practice to read straight from sheet music rather than memorize it?

What (else) happened July 1st 1858 in London?

Longest common substring in linear time

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

Greatest common substring

How do I extrude a face to a single vertex

MAXDOP Settings for SQL Server 2014

Why does Async/Await work properly when the loop is inside the async function and not the other way around?



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





code-golf string subsequence







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










  • $begingroup$
    Will the strings be only alphanumeric, or alphabetic, or only printable-ascii?
    $endgroup$
    – Embodiment of Ignorance
    7 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.

  • 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









$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










  • $begingroup$
    Will the strings be only alphanumeric, or alphabetic, or only printable-ascii?
    $endgroup$
    – Embodiment of Ignorance
    7 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.

  • 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









$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




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










  • $begingroup$
    Will the strings be only alphanumeric, or alphabetic, or only printable-ascii?
    $endgroup$
    – Embodiment of Ignorance
    7 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










  • $begingroup$
    Will the strings be only alphanumeric, or alphabetic, or only printable-ascii?
    $endgroup$
    – Embodiment of Ignorance
    7 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












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




$begingroup$
Will the strings be only alphanumeric, or alphabetic, or only printable-ascii?
$endgroup$
– Embodiment of Ignorance
7 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
      43 mins ago










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












    • $begingroup$
      102 bytes by using set operators instead
      $endgroup$
      – Jo King
      3 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, 3 bytes



      sᵛw


      Try it online!



      Full program.





      share











      $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 54 mins 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
                  43 mins ago










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












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










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












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










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












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










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












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












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




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














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




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

























                    answered 16 mins ago









                    Shieru AsakotoShieru Asakoto

                    2,750317




                    2,750317























                        0












                        $begingroup$


                        Brachylog, 3 bytes



                        sᵛw


                        Try it online!



                        Full program.





                        share











                        $endgroup$


















                          0












                          $begingroup$


                          Brachylog, 3 bytes



                          sᵛw


                          Try it online!



                          Full program.





                          share











                          $endgroup$
















                            0












                            0








                            0





                            $begingroup$


                            Brachylog, 3 bytes



                            sᵛw


                            Try it online!



                            Full program.





                            share











                            $endgroup$




                            Brachylog, 3 bytes



                            sᵛw


                            Try it online!



                            Full program.






                            share













                            share


                            share








                            answered 3 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

                                El tren de la libertad Índice Antecedentes "Porque yo decido" Desarrollo de la...

                                Image
                                Feminismo en EspañaAborto en EspañaManifestaciones y protestas en EspañaManifestaciones y protestas en 2014España en 2014Historia de las mujeres en España movimiento socialfeministaderechos sexuales y reproductivosmujeresLey del aborto en España1 de febrero2014MadridAlberto Ruíz Gallardónla ley del aborto vigente del 2010AsturiasTertulia Feminista Les ComadresCongreso de DiputadosAlicia MiyaresAna MatoAlberto Ruiz GallardónEdimburgoRomaParísLuxemburgoBuenos AiresGracia QuerejetaÁngeles González-SindeMabel LozanoIcíar BollaínIsabel CoixetGeorgina CisquellaTeresa FontVirginia Yagüe2010José Luis Rodríguez ZapateroCongreso de Diputados19 de diciembre20095 de julio2010Partido PopularTribunal Constitucional201120 de diciembre2013Partido PopularMariano RajoyGijónTertulia Feminista Les ComadresBegoña PiñeroRenfeAlicia MiyaresTertulia Feminista Les Comadres1 de febrero2014Congreso de DiputadosMariano RajoyAlberto Ruiz GallardónAna MatoAsturiasAndalucíaCanariasCataluñaComunidad ValencianaCasti...
                                Read more

                                Castillo d'Acher Características Menú de navegación

                                Image
                                Montañas de los Pirineos de AragónMontañas de la provincia de Huesca msnmSelva de OzaPirineo aragonésEspañabosque Este artículo o sección necesita referencias que aparezcan en una publicación acreditada. Este aviso fue puesto el 11 de agosto de 2011. El pico desde Selva de Oza. El Castillo d' Acher es una cima de 2.384msnm en la zona de la Selva de Oza en la parte occidental del Pirineo aragonés, en España. Debe su nombre a su aspecto de fortaleza que presenta hacia todas sus vertientes. Características En orden ascendente, la cima pasa de un bosque frondoso de tonalidades verde-amarillenta a laderas rojizas. Su cima, que suele presentarse mucha nieve, es un pequeño valle rectangular rodeado en sus cuatro caras por una muralla que le da un aspecto de fortaleza. This page is only for reference, If you need detailed information, please check here
                                Read more

                                Connecting two nodes from the same mother node horizontallyTikZ: What EXACTLY does the the |- notation for...

                                Image
                                Pigeonhole Principle Problem Was Hulk present at this event? Attending a conference where my ex-supervisor and his collaborator are present, should I attend? How did Arya manage to disguise herself? What is the word which sounds like "shtrass"? Does higher resolution in an image imply more bits per pixel? What was the state of the German rail system in 1944? Packet sniffer for MacOS Mojave and above Pressure to defend the relevance of one's area of mathematics Why are there synthetic chemicals in our bodies? Where do they come from? Does the Darkness spell dispel the Color Spray ...
                                Read more