Todos los desafíos
Intermedio 0 resueltos 0% de aceptación

DNA Short Tandem Repeats

For each short tandem repeat, find the longest run of back-to-back copies in a DNA sequence.

Lo que aprenderás

  • Compare a substring of a string with a pattern
  • Count back-to-back copies starting at a position
  • Keep the best count for each pattern

Problema

Ver traducción

Forensic labs compare people by short tandem repeats (STRs): short DNA units such as AGAT that appear many times in a row. For each unit, the lab records the longest run of consecutive copies anywhere in the sequence. In TTAGATAGATAGATCAGATAGAT the unit AGAT appears three times in a row near the start and twice later, so its count is 3.

Implement dna_str_count(sequence, repeats).

Input

sequence: The DNA sequence, using the letters A, C, G and T.

repeats: The STR units to measure.

Output

Return one count per unit, in the same order as repeats: the largest number of copies that appear back to back. A unit that never appears has count 0.

Restricciones

0 ≤ length of sequence ≤ 5,000

1 ≤ number of units ≤ 10

Each unit has 1 to 8 letters

Ejemplos

Ejemplo 1
Entrada:
sequence = "TTAGATAGATAGATCAGATAGAT"
repeats = ["AGAT", "CA"]

Salida esperada:
expected = [3, 1]
Entrada:
std::string sequence = "TTAGATAGATAGATCAGATAGAT";
std::vector<std::string> repeats = {"AGAT", "CA"};

Salida esperada:
std::vector<long long> expected = {3, 1};
Entrada:
string sequence = "TTAGATAGATAGATCAGATAGAT";
string[] repeats = new string[] {"AGAT", "CA"};

Salida esperada:
long[] expected = new long[] {3, 1};

Explicación

AGAT runs 3 times at the start and only twice at the end, so it scores 3; CA appears once, so it scores 1.

Ejemplo 2
Entrada:
sequence = "AATGAATGAATGTATC"
repeats = ["AATG", "TATC", "GATA"]

Salida esperada:
expected = [3, 1, 0]
Entrada:
std::string sequence = "AATGAATGAATGTATC";
std::vector<std::string> repeats = {"AATG", "TATC", "GATA"};

Salida esperada:
std::vector<long long> expected = {3, 1, 0};
Entrada:
string sequence = "AATGAATGAATGTATC";
string[] repeats = new string[] {"AATG", "TATC", "GATA"};

Salida esperada:
long[] expected = new long[] {3, 1, 0};

Explicación

AATG repeats 3 times, TATC once and GATA never: [3, 1, 0].

Cómo abordarlo

Inténtalo primero por tu cuenta y luego abre las pistas una a una.

Pista 1

From a start position, keep jumping forward by the unit length while the next piece equals the unit.

Pista 2

Try every start position and remember the largest run.

Pista 3

A unit that never matches leaves the best count at 0.

Complejidad esperada

O(n × m × k) time, O(m) extra space

Referencias

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.

Clasificación

Clasificación completa

La mejor solución aprobada de cada programador. Las más rápidas, ligeras y mejor valoradas van primero.

Aún no hay soluciones aprobadas. Resuélvelo y quédate el primer puesto.

Aprende de otros

Soluciones de la comunidad

Aún no hay soluciones publicadas. Resuelve este reto para compartir la primera.