Test results - Codility

Tasks Details

medium

1. GenomicRangeQuery

Find the minimal nucleotide from a range of sequence DNA.

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] = 6

The 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] = 6

the 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.

Solution

Programming language used JavaScript

Time spent on task 21 minutes

Notes

not defined yet

Task timeline

Code: 16:41:19 UTC, js, verify, result: Failed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36

// 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 4.0.0)
    
    var lastA = [];
    var lastC = [];
    var lastG = [];
    
    for(var i=0; i<S.length; i++) {
        if(i===0) {
            lastA.push(0);
            lastC.push(0);
            lastG.push(0);
        }
        
        console.log('S[' + i + ']:' + S[i]);
    }
    
    for(var i=0; i<P.length; i++) {
        
    }
}

function value(gene) {
    if(gene == 'A') {
        return 1;
    } else if(gene == 'C') {
        return 2;
    } else if(gene == 'G') {
        return 3;
    } else {
        return 4;
    }
}

Analysis

▶

example
example test

✘

RUNTIME ERROR
tested program terminated unexpectedly

Code: 16:43:20 UTC, js, verify, result: Failed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52

// 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 4.0.0)
    
    var lastA = [];
    var lastC = [];
    var lastG = [];
    
    for(var i=0; i<S.length; i++) {
        if(i===0) {
            lastA.push(0);
            lastC.push(0);
            lastG.push(0);
        } else {
            lastA.push(lastA[i-1]);
            lastC.push(lastC[i-1]);
            lastG.push(lastG[i-1]);
        }
        
        console.log('S[' + i + ']:' + S[i]);
        
        if(S[i] == 'A') {
            lastA[i] = i;
        } else if(S[i] == 'C') {
            lastC[i] = i;
        } else if(S[i] == 'G') {
            lastG[i] = i;
        }
    }
    
    console.log('lastA:', lastA);
    console.log('lastC:', lastC);
    console.log('lastG:', lastG);
    
    for(var i=0; i<P.length; i++) {
        
    }
}

function value(gene) {
    if(gene == 'A') {
        return 1;
    } else if(gene == 'C') {
        return 2;
    } else if(gene == 'G') {
        return 3;
    } else {
        return 4;
    }
}

Analysis

▶

example
example test

✘

RUNTIME ERROR
tested program terminated unexpectedly

Code: 16:43:42 UTC, js, verify, result: Failed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52

// 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 4.0.0)
    
    var lastA = [];
    var lastC = [];
    var lastG = [];
    
    for(var i=0; i<S.length; i++) {
        if(i===0) {
            lastA.push(-1);
            lastC.push(-1);
            lastG.push(-1);
        } else {
            lastA.push(lastA[i-1]);
            lastC.push(lastC[i-1]);
            lastG.push(lastG[i-1]);
        }
        
        console.log('S[' + i + ']:' + S[i]);
        
        if(S[i] == 'A') {
            lastA[i] = i;
        } else if(S[i] == 'C') {
            lastC[i] = i;
        } else if(S[i] == 'G') {
            lastG[i] = i;
        }
    }
    
    console.log('lastA:', lastA);
    console.log('lastC:', lastC);
    console.log('lastG:', lastG);
    
    for(var i=0; i<P.length; i++) {
        
    }
}

function value(gene) {
    if(gene == 'A') {
        return 1;
    } else if(gene == 'C') {
        return 2;
    } else if(gene == 'G') {
        return 3;
    } else {
        return 4;
    }
}

Analysis

▶

example
example test

✘

RUNTIME ERROR
tested program terminated unexpectedly

Code: 16:45:48 UTC, js, verify, result: Failed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60

// 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 4.0.0)
    
    var lastA = [];
    var lastC = [];
    var lastG = [];
    
    for(var i=0; i<S.length; i++) {
        if(i===0) {
            lastA.push(-1);
            lastC.push(-1);
            lastG.push(-1);
        } else {
            lastA.push(lastA[i-1]);
            lastC.push(lastC[i-1]);
            lastG.push(lastG[i-1]);
        }
        
        console.log('S[' + i + ']:' + S[i]);
        
        if(S[i] == 'A') {
            lastA[i] = i;
        } else if(S[i] == 'C') {
            lastC[i] = i;
        } else if(S[i] == 'G') {
            lastG[i] = i;
        }
    }
    
    //console.log('lastA:', lastA);
    //console.log('lastC:', lastC);
    //console.log('lastG:', lastG);
    
    for(var i=0; i<P.length; i++) {
        if(lastA[Q[i]] >= P[i]) {
            return 1;
        } else if(lastC[Q[i]] >= P[i]) {
            return 2;
        } else if(lastG[Q[i]] >= P[i]) {
            return 3;
        } else {
            return 4;
        }
    }
}

function value(gene) {
    if(gene == 'A') {
        return 1;
    } else if(gene == 'C') {
        return 2;
    } else if(gene == 'G') {
        return 3;
    } else {
        return 4;
    }
}

Analysis

▶

example
example test

✘

RUNTIME ERROR
tested program terminated unexpectedly

Code: 16:46:30 UTC, js, verify, result: Failed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61

// 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 4.0.0)
    
    var result = [];
    var lastA = [];
    var lastC = [];
    var lastG = [];
    
    for(var i=0; i<S.length; i++) {
        if(i===0) {
            lastA.push(-1);
            lastC.push(-1);
            lastG.push(-1);
        } else {
            lastA.push(lastA[i-1]);
            lastC.push(lastC[i-1]);
            lastG.push(lastG[i-1]);
        }
        
        console.log('S[' + i + ']:' + S[i]);
        
        if(S[i] == 'A') {
            lastA[i] = i;
        } else if(S[i] == 'C') {
            lastC[i] = i;
        } else if(S[i] == 'G') {
            lastG[i] = i;
        }
    }
    
    //console.log('lastA:', lastA);
    //console.log('lastC:', lastC);
    //console.log('lastG:', lastG);
    
    for(var 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);
        }
    }
}

function value(gene) {
    if(gene == 'A') {
        return 1;
    } else if(gene == 'C') {
        return 2;
    } else if(gene == 'G') {
        return 3;
    } else {
        return 4;
    }
}

Analysis

▶

example
example test

✘

RUNTIME ERROR
tested program terminated unexpectedly

Code: 16:46:39 UTC, js, verify, result: Passed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63

// 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 4.0.0)
    
    var result = [];
    var lastA = [];
    var lastC = [];
    var lastG = [];
    
    for(var i=0; i<S.length; i++) {
        if(i===0) {
            lastA.push(-1);
            lastC.push(-1);
            lastG.push(-1);
        } else {
            lastA.push(lastA[i-1]);
            lastC.push(lastC[i-1]);
            lastG.push(lastG[i-1]);
        }
        
        console.log('S[' + i + ']:' + S[i]);
        
        if(S[i] == 'A') {
            lastA[i] = i;
        } else if(S[i] == 'C') {
            lastC[i] = i;
        } else if(S[i] == 'G') {
            lastG[i] = i;
        }
    }
    
    //console.log('lastA:', lastA);
    //console.log('lastC:', lastC);
    //console.log('lastG:', lastG);
    
    for(var 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;
}

function value(gene) {
    if(gene == 'A') {
        return 1;
    } else if(gene == 'C') {
        return 2;
    } else if(gene == 'G') {
        return 3;
    } else {
        return 4;
    }
}

Analysis

▶

example
example test

✔

Code: 16:46:50 UTC, js, verify, result: Passed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63

// 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 4.0.0)
    
    var result = [];
    var lastA = [];
    var lastC = [];
    var lastG = [];
    
    for(var i=0; i<S.length; i++) {
        if(i===0) {
            lastA.push(-1);
            lastC.push(-1);
            lastG.push(-1);
        } else {
            lastA.push(lastA[i-1]);
            lastC.push(lastC[i-1]);
            lastG.push(lastG[i-1]);
        }
        
        //console.log('S[' + i + ']:' + S[i]);
        
        if(S[i] == 'A') {
            lastA[i] = i;
        } else if(S[i] == 'C') {
            lastC[i] = i;
        } else if(S[i] == 'G') {
            lastG[i] = i;
        }
    }
    
    //console.log('lastA:', lastA);
    //console.log('lastC:', lastC);
    //console.log('lastG:', lastG);
    
    for(var 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;
}

function value(gene) {
    if(gene == 'A') {
        return 1;
    } else if(gene == 'C') {
        return 2;
    } else if(gene == 'G') {
        return 3;
    } else {
        return 4;
    }
}

Analysis

▶

example
example test

✔

Code: 16:47:15 UTC, js, verify, result: Passed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63

// 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 4.0.0)
    
    var result = [];
    var lastA = [];
    var lastC = [];
    var lastG = [];
    
    for(var i=0; i<S.length; i++) {
        if(i===0) {
            lastA.push(-1);
            lastC.push(-1);
            lastG.push(-1);
        } else {
            lastA.push(lastA[i-1]);
            lastC.push(lastC[i-1]);
            lastG.push(lastG[i-1]);
        }
        
        //console.log('S[' + i + ']:' + S[i]);
        
        if(S[i] == 'A') {
            lastA[i] = i;
        } else if(S[i] == 'C') {
            lastC[i] = i;
        } else if(S[i] == 'G') {
            lastG[i] = i;
        }
    }
    
    //console.log('lastA:', lastA);
    //console.log('lastC:', lastC);
    //console.log('lastG:', lastG);
    
    for(var 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;
}

function value(gene) {
    if(gene == 'A') {
        return 1;
    } else if(gene == 'C') {
        return 2;
    } else if(gene == 'G') {
        return 3;
    } else {
        return 4;
    }
}

Analysis

▶

example
example test

✔

Code: 16:47:17 UTC, js, final, score: 100

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63

// 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 4.0.0)
    
    var result = [];
    var lastA = [];
    var lastC = [];
    var lastG = [];
    
    for(var i=0; i<S.length; i++) {
        if(i===0) {
            lastA.push(-1);
            lastC.push(-1);
            lastG.push(-1);
        } else {
            lastA.push(lastA[i-1]);
            lastC.push(lastC[i-1]);
            lastG.push(lastG[i-1]);
        }
        
        //console.log('S[' + i + ']:' + S[i]);
        
        if(S[i] == 'A') {
            lastA[i] = i;
        } else if(S[i] == 'C') {
            lastC[i] = i;
        } else if(S[i] == 'G') {
            lastG[i] = i;
        }
    }
    
    //console.log('lastA:', lastA);
    //console.log('lastC:', lastC);
    //console.log('lastG:', lastG);
    
    for(var 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;
}

function value(gene) {
    if(gene == 'A') {
        return 1;
    } else if(gene == 'C') {
        return 2;
    } else if(gene == 'G') {
        return 3;
    } else {
        return 4;
    }
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N + M)

▶

example
example test

✔

▶

extreme_sinlge
single character string

✔

▶

extreme_double
double character string

✔

▶

simple
simple tests

✔

▶

small_length_string
small length simple string

✔

▶

small_random
small random string, length = ~300

✔

▶

almost_all_same_letters
GGGGGG..??..GGGGGG..??..GGGGGG

✔

▶

large_random
large random string, length

✔

▶

extreme_large
all max ranges

✔