Tasks Details
medium
Find the minimal nucleotide from a range of sequence DNA.
Task Score
100%
Correctness
100%
Performance
100%
A DNA sequence can be represented as a string consisting of the letters A, C, G and T, which correspond to the types of successive nucleotides in the sequence. Each nucleotide has an impact factor, which is an integer. Nucleotides of types A, C, G and T have impact factors of 1, 2, 3 and 4, respectively. You are going to answer several queries of the form: What is the minimal impact factor of nucleotides contained in a particular part of the given DNA sequence?
The DNA sequence is given as a non-empty string S = S[0]S[1]...S[N-1] consisting of N characters. There are M queries, which are given in non-empty arrays P and Q, each consisting of M integers. The K-th query (0 ≤ K < M) requires you to find the minimal impact factor of nucleotides contained in the DNA sequence between positions P[K] and Q[K] (inclusive).
For example, consider string S = CAGCCTA and arrays P, Q such that:
P[0] = 2 Q[0] = 4 P[1] = 5 Q[1] = 5 P[2] = 0 Q[2] = 6The answers to these M = 3 queries are as follows:
- The part of the DNA between positions 2 and 4 contains nucleotides G and C (twice), whose impact factors are 3 and 2 respectively, so the answer is 2.
- The part between positions 5 and 5 contains a single nucleotide T, whose impact factor is 4, so the answer is 4.
- The part between positions 0 and 6 (the whole string) contains all nucleotides, in particular nucleotide A whose impact factor is 1, so the answer is 1.
Write a function:
function solution(S, P, Q);
that, given a non-empty string S consisting of N characters and two non-empty arrays P and Q consisting of M integers, returns an array consisting of M integers specifying the consecutive answers to all queries.
Result array should be returned as an array of integers.
For example, given the string S = CAGCCTA and arrays P, Q such that:
P[0] = 2 Q[0] = 4 P[1] = 5 Q[1] = 5 P[2] = 0 Q[2] = 6the function should return the values [2, 4, 1], as explained above.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..100,000];
- M is an integer within the range [1..50,000];
- each element of arrays P and Q is an integer within the range [0..N - 1];
- P[K] ≤ Q[K], where 0 ≤ K < M;
- string S consists only of upper-case English letters A, C, G, T.
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 12 minutes
Notes
not defined yet
Code: 12:13:44 UTC,
java,
autosave
Code: 12:14:56 UTC,
js,
autosave
Code: 12:15:26 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
}
Code: 12:15:56 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
}
Code: 12:16:26 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
}
}
Code: 12:16:56 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [-1];
let lastC = [-1];
let lastG = [-1];
for (let i = 0; i < S.length; i++) {
}
}
Code: 12:17:26 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [-1];
let lastC = [-1];
let lastG = [-1];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
}
}
}
Code: 12:17:43 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [-1];
let lastC = [-1];
let lastG = [-1];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] =
}
}
}
Code: 12:18:10 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
}
}
}
Code: 12:18:27 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
}
}
}
Code: 12:18:42 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = -1;
lastG[i] = -1;
}
}
}
Code: 12:18:57 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
}
}
Code: 12:19:27 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[]
}
}
}
Code: 12:19:44 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if
}
}
Code: 12:20:00 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'A') {
lastA[i] = i;
} else
}
}
Code: 12:20:18 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
}
Code: 12:20:29 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
}
Code: 12:20:42 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
for (let i = 0)
}
Code: 12:21:07 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
for (let i = 0; i < P.length; i++) {
}
}
Code: 12:21:19 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
for (let i = 0; i < P.length; i++) {
if()
}
}
Code: 12:21:49 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
for (let i = 0; i < P.length; i++) {
if(lastA[Q[i]] )
}
}
Code: 12:22:00 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
for (let i = 0; i < P.length; i++) {
if(lastA[Q[i]] >= P[i]) {
}
}
}
Code: 12:22:18 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
for (let i = 0; i < P.length; i++) {
if(lastA[Q[i]] >= P[i]) {
result.push(1);
} else
}
}
Code: 12:22:47 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
for (let i = 0; i < P.length; i++) {
if(lastA[Q[i]] >= P[i]) {
result.push(1);
} else if(lastC[Q[i]] >= P[i]) {
result.push(2);
} else if(lastG[Q[i]] >= P[i]) {
result.push(3);
} else {
}
}
}
Code: 12:22:59 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
let impact = {
A: 1,
C: 2,
G: 3,
T: 4,
};
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
for (let i = 0; i < P.length; i++) {
if(lastA[Q[i]] >= P[i]) {
result.push(1);
} else if(lastC[Q[i]] >= P[i]) {
result.push(2);
} else if(lastG[Q[i]] >= P[i]) {
result.push(3);
} else {
result.push(3);
}
}
return result;
}
Code: 12:23:05 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
for (let i = 0; i < P.length; i++) {
if(lastA[Q[i]] >= P[i]) {
result.push(1);
} else if(lastC[Q[i]] >= P[i]) {
result.push(2);
} else if(lastG[Q[i]] >= P[i]) {
result.push(3);
} else {
result.push(3);
}
}
return result;
}
Analysis
expand all
Example tests
1.
0.068 s
WRONG ANSWER,
got [2, 3, 1] expected [2, 4, 1]
Code: 12:23:20 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
for (let i = 0; i < P.length; i++) {
if(lastA[Q[i]] >= P[i]) {
result.push(1);
} else if(lastC[Q[i]] >= P[i]) {
result.push(2);
} else if(lastG[Q[i]] >= P[i]) {
result.push(3);
} else {
result.push(4);
}
}
return result;
}
Analysis
Code: 12:23:29 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
for (let i = 0; i < P.length; i++) {
if(lastA[Q[i]] >= P[i]) {
result.push(1);
} else if(lastC[Q[i]] >= P[i]) {
result.push(2);
} else if(lastG[Q[i]] >= P[i]) {
result.push(3);
} else {
result.push(4);
}
}
return result;
}
Code: 12:23:46 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
for (let i = 0; i < P.length; i++) {
if(lastA[Q[i]] >= P[i]) {
result.push(1);
} else if(lastC[Q[i]] >= P[i]) {
result.push(2);
} else if(lastG[Q[i]] >= P[i]) {
result.push(3);
} else {
result.push(4);
}
}
return result;
}
Code: 12:23:58 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
for (let i = 0; i < P.length; i++) {
if(lastA[Q[i]] >= P[i]) {
result.push(1);
} else if(lastC[Q[i]] >= P[i]) {
result.push(2);
} else if(lastG[Q[i]] >= P[i]) {
result.push(3);
} else {
result.push(4);
}
}
return result;
}
Code: 12:24:02 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
for (let i = 0; i < P.length; i++) {
if(lastA[Q[i]] >= P[i]) {
result.push(1);
} else if(lastC[Q[i]] >= P[i]) {
result.push(2);
} else if(lastG[Q[i]] >= P[i]) {
result.push(3);
} else {
result.push(4);
}
}
return result;
}
User test case 1:
['CCCCCCC', [0, 1, 5], [6, 6, 5]]
Analysis
Code: 12:24:14 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
for (let i = 0; i < P.length; i++) {
if(lastA[Q[i]] >= P[i]) {
result.push(1);
} else if(lastC[Q[i]] >= P[i]) {
result.push(2);
} else if(lastG[Q[i]] >= P[i]) {
result.push(3);
} else {
result.push(4);
}
}
return result;
}
Code: 12:24:38 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
for (let i = 0; i < P.length; i++) {
if(lastA[Q[i]] >= P[i]) {
result.push(1);
} else if(lastC[Q[i]] >= P[i]) {
result.push(2);
} else if(lastG[Q[i]] >= P[i]) {
result.push(3);
} else {
result.push(4);
}
}
return result;
}
Code: 12:24:49 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
for (let i = 0; i < P.length; i++) {
if(lastA[Q[i]] >= P[i]) {
result.push(1);
} else if(lastC[Q[i]] >= P[i]) {
result.push(2);
} else if(lastG[Q[i]] >= P[i]) {
result.push(3);
} else {
result.push(4);
}
}
return result;
}
Code: 12:24:54 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
for (let i = 0; i < P.length; i++) {
if(lastA[Q[i]] >= P[i]) {
result.push(1);
} else if(lastC[Q[i]] >= P[i]) {
result.push(2);
} else if(lastG[Q[i]] >= P[i]) {
result.push(3);
} else {
result.push(4);
}
}
return result;
}
User test case 1:
['CCCCCCC', [0, 1, 5], [6, 6, 5]]
User test case 2:
['CACCCCC', [0, 1, 5], [6, 6, 5]]
User test case 3:
['TTTTTTTA', [5, 5, 5, 0], [5, 6, 7, 7]]
Analysis
expand all
User tests
1.
0.068 s
OK
function result: [2, 2, 2]
function result: [2, 2, 2]
1.
0.068 s
OK
function result: [1, 1, 2]
function result: [1, 1, 2]
1.
0.068 s
OK
function result: [4, 4, 1, 1]
function result: [4, 4, 1, 1]
Code: 12:25:05 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
for (let i = 0; i < P.length; i++) {
if(lastA[Q[i]] >= P[i]) {
result.push(1);
} else if(lastC[Q[i]] >= P[i]) {
result.push(2);
} else if(lastG[Q[i]] >= P[i]) {
result.push(3);
} else {
result.push(4);
}
}
return result;
}
User test case 1:
['CCCCCCC', [0, 1, 5], [6, 6, 5]]
User test case 2:
['CACCCCC', [0, 1, 5], [6, 6, 5]]
User test case 3:
['TTTTTTTA', [5, 5, 5, 0], [5, 6, 7, 7]]
Analysis
expand all
User tests
1.
0.072 s
OK
function result: [2, 2, 2]
function result: [2, 2, 2]
1.
0.072 s
OK
function result: [1, 1, 2]
function result: [1, 1, 2]
1.
0.072 s
OK
function result: [4, 4, 1, 1]
function result: [4, 4, 1, 1]
Code: 12:25:08 UTC,
js,
final,
score:
100
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(S, P, Q) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
// track the most recent previous occurance of letters
let lastA = [];
let lastC = [];
let lastG = [];
for (let i = 0; i < S.length; i++) {
if (i === 0) {
lastA[i] = -1;
lastC[i] = -1;
lastG[i] = -1;
} else {
lastA[i] = lastA[i-1];
lastC[i] = lastC[i-1];
lastG[i] = lastG[i-1];
}
if (S[i] === 'A') {
lastA[i] = i;
} else if (S[i] === 'C') {
lastC[i] = i;
} else if (S[i] === 'G') {
lastG[i] = i;
}
}
for (let i = 0; i < P.length; i++) {
if(lastA[Q[i]] >= P[i]) {
result.push(1);
} else if(lastC[Q[i]] >= P[i]) {
result.push(2);
} else if(lastG[Q[i]] >= P[i]) {
result.push(3);
} else {
result.push(4);
}
}
return result;
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N + M)
expand all
Correctness tests
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
1.
0.072 s
OK
1.
0.072 s
OK