Empresas
Empregos
  • Sobre nós
  • Soluções
    • Publicação de vagas
      Publique sua vaga e receba candidatos qualificados em 48h.
    • Avaliações de candidatos
      Mais de 500 testes técnicos e psicológicos, mais anti-fraude.
    • Headhunting
      Busca executiva personalizada do início ao fim.
    • Folha de Pagamento + EOR
      Dispersão de folha e EOR em mais de 15 países da LATAM.
  • Preços
  • Empregos

0

217
Visualizações
find the overlap between two strings

I have a string and I need to check with and get whether following strings are overlapped at my tagart string with its end or start.

Target string: "click on the Run"

search strings: "the Run button to" ,"code and click on"

Apparently:

"the Run button to" is overlapped at the end of target "click on the Run"

"code and click on" is overlapped at the start of target "click on the Run"

So "the Run" and "click on" will be the results I need

I have come up with a function to check and get the overlapped results for the cases at the start and at the end separately

Question:

But my code could not be able to get the expected results only if I know the how the search string overlap with target string in the very first place. And how can I combine the searched results in one go as well?

function findOverlapAtEnd(a, b) {
  if (b.length === 2) {
    return "";
  }

  if (a.indexOf(b) >= 0) {
    return b;
  }

  if (a.endsWith(b)) {
    return b;
  }



  return findOverlapAtEnd(a, b.substring(0, b.length - 1));
}

function findOverlapAtStart(a, b) {
  if (b.length === 2) {
    return "";
  }

  if (a.indexOf(b) >= 0) {
    return b;
  }

  if (a.startsWith(b)) {
    return b;
  }



  return findOverlapAtStart(a, b.substring(1));
}

console.log(findOverlapAtEnd("click on the Run", "the Run button to"))

console.log(findOverlapAtStart("click on the Run", "code and click on"))

about 4 years ago · Juan Pablo Isaza
1 Respostas
Responde à pergunta

0

Because I need to decompress and I find these logic puzzles fun, here's my solution to the problem...

https://highdex.net/begin_end_overlap.htm

You can view source of the page to see JavaScript code I used. But just in case I ever take that page down, here's the important function...

function GetOverlappingSection(str1, str2, minOverlapLen = 4) {
    var work1 = str1;
    var work2 = str2;
    var w1Len = work1.length;
    var w2Len = work2.length;
    var resultStr = "";
    var foundResult = false;
    var workIndex;
    
    if (minOverlapLen < 1) { minOverlapLen = 1; }
    else if (minOverlapLen > (w1Len > w2Len ? w2Len : w1Len)) { minOverlapLen = (w1Len > w2Len ? w2Len : w1Len); }
    
    //debugger;
    
    //we have four loops to go through.  We trim each string down from each end and see if it matches either end of the other string.
    for (var i1f = 0; i1f < w1Len; i1f++) {
        workIndex = work2.indexOf(work1);
        if (workIndex == 0 || (workIndex != -1 && workIndex == w2Len - work1.length)) { 
            //we found a match!
            foundResult = true;
            resultStr = work1;
            break;
        }
        
        work1 = work1.substr(1);
        if (work1.length < minOverlapLen) { break; }
    }

    
    if (!foundResult) { 
        //debugger;
    
        //reset the work vars...
        work1 = str1;
        
        for (var i1b = 0; i1b < w1Len; i1b++) {
            workIndex = work2.indexOf(work1);
            if (workIndex == 0 || (workIndex != -1 && workIndex == w2Len - work1.length)) { 
                //we found a match!
                foundResult = true;
                resultStr = work1;
                break;
            }
            
            work1 = work1.substr(0, work1.length - 1);
            if (work1.length < minOverlapLen) { break; }
        }
    }
    
    if (!foundResult) {
        //debugger;
    
        //reset the work vars...
        work1 = str1;
        
        for (var i2f = 0; i2f < w2Len; i2f++) {
            workIndex = work1.indexOf(work2);
            if (workIndex == 0 || (workIndex != -1 && workIndex == w1Len - work2.length)) { 
                //we found a match!
                foundResult = true;
                resultStr = work2;
                break;
            }
            
            work2 = work2.substr(1);
            if (work2.length < minOverlapLen) { break; }
        }
    }
    
    if (!foundResult) {
        //debugger;
    
        //reset the work vars...
        work2 = str2;
        
        for (var i2b = 0; i2b < w2Len; i2b++) {
            workIndex = work1.indexOf(work2);
            if (workIndex == 0 || (workIndex != -1 && workIndex == w1Len - work2.length)) { 
                //we found a match!
                foundResult = true;
                resultStr = work2;
                break;
            }
            
            work2 = work2.substr(0, work2.length - 1);
            if (work2.length < minOverlapLen) { break; }
        }
    }
    
    return resultStr;
}

Hopefully that's helpful.

about 4 years ago · Juan Pablo Isaza Relatório
Responde à pergunta
Encontrar trabalhos remotos

Descubra a nova forma de encontrar um emprego!

melhores empregos
Principais categorias de trabalho
Empresas
Postar vaga Preços Comercial
Jurídico
Termos e Condições Política de privacidade
© 2026 PeakU Inc. All Rights Reserved.
Andres GPT
Recomende algumas ofertas para mim
Preciso de ajuda