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:
class Solution { public int[] solution(String S, int[] P, int[] 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–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Java 8
Time spent on task 55 minutes
Notes
not defined yet
Task timeline
Code: 03:25:27 UTC,
java,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
// write your code in Java SE 8
int[] res = new int[P.length];
if(P.length != Q.length)
return res;
int[] A = new int[P.length];
int[] C = new int[P.length];
int[] G = new int[P.length];
int[] T = new int[P.length];
int strLength = S.length();
Switch(S.charAt(0)) {
case 'A':
A[i] = 1;
break;
case 'C':
C[i] = 2;
break;
case 'G':
G[i] = 3;
break;
case 'T':
T[i] = 4;
break;
default:
break;
}
for(int i=1; i<strLength;i++) {
Switch(S.charAt(i)) {
case 'A':
A[i] = A[i-1]+1;
C[i] = C[i-1];
G[i] = G[i-1];
T[i] = T[i-1];
break;
case 'C':
A[i] = A[i-1];
C[i] = C[i-1] + 2;
G[i] = G[i-1];
T[i] = T[i-1];
break;
case 'G':
A[i] = A[i-1];
C[i] = C[i-1];
G[i] = G[i-1] + 3;
T[i] = T[i-1];
break;
case 'T':
A[i] = A[i-1];
C[i] = C[i-1];
G[i] = G[i-1];
T[i] = T[i-1] + 4;
break;
default:
break;
}
}
for(int i=0; i<P.length; i++) {
if(P[i] == 0) {
if(A[Q[i] > 0)
res[i] =1;
else if(C[Q[i] > 0)
res[i] =2;
else if(G[Q[i] > 0)
res[i] =3;
else if(T[Q[i] > 0)
res[i] =4;
}else {
if(A[Q[i]] - A[P[i]-1] > 0)
res[i] = 1;
else if(C[Q[i]] - C[P[i]-1] > 0)
res[i] = 2;
else if(G[Q[i]] - G[P[i]-1] > 0)
res[i] = 3;
else if(T[Q[i]] - T[P[i]-1] > 0)
res[i] = 4;
}
}
return res;
}
}
Analysis
Compile error
Solution.java:18: error: ';' expected
Switch(S.charAt(0)) {
^
Solution.java:19: error: orphaned case
case 'A':
^
Solution.java:35: error: ';' expected
Switch(S.charAt(i)) {
^
Solution.java:36: error: orphaned case
case 'A':
^
Solution.java:66: error: ']' expected
if(A[Q[i] > 0)
^
Solution.java:68: error: ']' expected
else if(C[Q[i] > 0)
^
Solution.java:70: error: ']' expected
else if(G[Q[i] > 0)
^
Solution.java:72: error: ']' expected
else if(T[Q[i] > 0)
^
8 errors
Code: 03:26:13 UTC,
java,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
// write your code in Java SE 8
int[] res = new int[P.length];
if(P.length != Q.length)
return res;
int[] A = new int[P.length];
int[] C = new int[P.length];
int[] G = new int[P.length];
int[] T = new int[P.length];
int strLength = S.length();
switch(S.charAt(0)) {
case 'A':
A[i] = 1;
break;
case 'C':
C[i] = 2;
break;
case 'G':
G[i] = 3;
break;
case 'T':
T[i] = 4;
break;
default:
break;
}
for(int i=1; i<strLength;i++) {
Switch(S.charAt(i)) {
case 'A':
A[i] = A[i-1]+1;
C[i] = C[i-1];
G[i] = G[i-1];
T[i] = T[i-1];
break;
case 'C':
A[i] = A[i-1];
C[i] = C[i-1] + 2;
G[i] = G[i-1];
T[i] = T[i-1];
break;
case 'G':
A[i] = A[i-1];
C[i] = C[i-1];
G[i] = G[i-1] + 3;
T[i] = T[i-1];
break;
case 'T':
A[i] = A[i-1];
C[i] = C[i-1];
G[i] = G[i-1];
T[i] = T[i-1] + 4;
break;
default:
break;
}
}
for(int i=0; i<P.length; i++) {
if(P[i] == 0) {
if(A[Q[i] > 0)
res[i] =1;
else if(C[Q[i] > 0)
res[i] =2;
else if(G[Q[i] > 0)
res[i] =3;
else if(T[Q[i] > 0)
res[i] =4;
}else {
if(A[Q[i]] - A[P[i]-1] > 0)
res[i] = 1;
else if(C[Q[i]] - C[P[i]-1] > 0)
res[i] = 2;
else if(G[Q[i]] - G[P[i]-1] > 0)
res[i] = 3;
else if(T[Q[i]] - T[P[i]-1] > 0)
res[i] = 4;
}
}
return res;
}
}
Analysis
Compile error
Solution.java:35: error: ';' expected
Switch(S.charAt(i)) {
^
Solution.java:36: error: orphaned case
case 'A':
^
Solution.java:66: error: ']' expected
if(A[Q[i] > 0)
^
Solution.java:68: error: ']' expected
else if(C[Q[i] > 0)
^
Solution.java:70: error: ']' expected
else if(G[Q[i] > 0)
^
Solution.java:72: error: ']' expected
else if(T[Q[i] > 0)
^
6 errors
Code: 03:26:30 UTC,
java,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
// write your code in Java SE 8
int[] res = new int[P.length];
if(P.length != Q.length)
return res;
int[] A = new int[P.length];
int[] C = new int[P.length];
int[] G = new int[P.length];
int[] T = new int[P.length];
int strLength = S.length();
switch(S.charAt(0)) {
case 'A':
A[i] = 1;
break;
case 'C':
C[i] = 2;
break;
case 'G':
G[i] = 3;
break;
case 'T':
T[i] = 4;
break;
default:
break;
}
for(int i=1; i<strLength;i++) {
switch(S.charAt(i)) {
case 'A':
A[i] = A[i-1]+1;
C[i] = C[i-1];
G[i] = G[i-1];
T[i] = T[i-1];
break;
case 'C':
A[i] = A[i-1];
C[i] = C[i-1] + 2;
G[i] = G[i-1];
T[i] = T[i-1];
break;
case 'G':
A[i] = A[i-1];
C[i] = C[i-1];
G[i] = G[i-1] + 3;
T[i] = T[i-1];
break;
case 'T':
A[i] = A[i-1];
C[i] = C[i-1];
G[i] = G[i-1];
T[i] = T[i-1] + 4;
break;
default:
break;
}
}
for(int i=0; i<P.length; i++) {
if(P[i] == 0) {
if(A[Q[i] > 0)
res[i] =1;
else if(C[Q[i] > 0)
res[i] =2;
else if(G[Q[i] > 0)
res[i] =3;
else if(T[Q[i] > 0)
res[i] =4;
}else {
if(A[Q[i]] - A[P[i]-1] > 0)
res[i] = 1;
else if(C[Q[i]] - C[P[i]-1] > 0)
res[i] = 2;
else if(G[Q[i]] - G[P[i]-1] > 0)
res[i] = 3;
else if(T[Q[i]] - T[P[i]-1] > 0)
res[i] = 4;
}
}
return res;
}
}
Analysis
Compile error
Solution.java:66: error: ']' expected
if(A[Q[i] > 0)
^
Solution.java:68: error: ']' expected
else if(C[Q[i] > 0)
^
Solution.java:70: error: ']' expected
else if(G[Q[i] > 0)
^
Solution.java:72: error: ']' expected
else if(T[Q[i] > 0)
^
4 errors
Code: 03:27:02 UTC,
java,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
// write your code in Java SE 8
int[] res = new int[P.length];
if(P.length != Q.length)
return res;
int[] A = new int[P.length];
int[] C = new int[P.length];
int[] G = new int[P.length];
int[] T = new int[P.length];
int strLength = S.length();
switch(S.charAt(0)) {
case 'A':
A[i] = 1;
break;
case 'C':
C[i] = 2;
break;
case 'G':
G[i] = 3;
break;
case 'T':
T[i] = 4;
break;
default:
break;
}
for(int i=1; i<strLength;i++) {
switch(S.charAt(i)) {
case 'A':
A[i] = A[i-1]+1;
C[i] = C[i-1];
G[i] = G[i-1];
T[i] = T[i-1];
break;
case 'C':
A[i] = A[i-1];
C[i] = C[i-1] + 2;
G[i] = G[i-1];
T[i] = T[i-1];
break;
case 'G':
A[i] = A[i-1];
C[i] = C[i-1];
G[i] = G[i-1] + 3;
T[i] = T[i-1];
break;
case 'T':
A[i] = A[i-1];
C[i] = C[i-1];
G[i] = G[i-1];
T[i] = T[i-1] + 4;
break;
default:
break;
}
}
for(int i=0; i<P.length; i++) {
if(P[i] == 0) {
if(A[Q[i]] > 0)
res[i] =1;
else if(C[Q[i]] > 0)
res[i] =2;
else if(G[Q[i]] > 0)
res[i] =3;
else if(T[Q[i]] > 0)
res[i] =4;
}else {
if(A[Q[i]] - A[P[i]-1] > 0)
res[i] = 1;
else if(C[Q[i]] - C[P[i]-1] > 0)
res[i] = 2;
else if(G[Q[i]] - G[P[i]-1] > 0)
res[i] = 3;
else if(T[Q[i]] - T[P[i]-1] > 0)
res[i] = 4;
}
}
return res;
}
}
Analysis
Compile error
Solution.java:20: error: cannot find symbol
A[i] = 1;
^
symbol: variable i
location: class Solution
Solution.java:23: error: cannot find symbol
C[i] = 2;
^
symbol: variable i
location: class Solution
Solution.java:26: error: cannot find symbol
G[i] = 3;
^
symbol: variable i
location: class Solution
Solution.java:29: error: cannot find symbol
T[i] = 4;
^
symbol: variable i
location: class Solution
4 errors
Code: 03:27:30 UTC,
java,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
// write your code in Java SE 8
int[] res = new int[P.length];
if(P.length != Q.length)
return res;
int[] A = new int[P.length];
int[] C = new int[P.length];
int[] G = new int[P.length];
int[] T = new int[P.length];
int strLength = S.length();
switch(S.charAt(0)) {
case 'A':
A[0] = 1;
break;
case 'C':
C[0] = 2;
break;
case 'G':
G[0] = 3;
break;
case 'T':
T[0] = 4;
break;
default:
break;
}
for(int i=1; i<strLength;i++) {
switch(S.charAt(i)) {
case 'A':
A[i] = A[i-1]+1;
C[i] = C[i-1];
G[i] = G[i-1];
T[i] = T[i-1];
break;
case 'C':
A[i] = A[i-1];
C[i] = C[i-1] + 2;
G[i] = G[i-1];
T[i] = T[i-1];
break;
case 'G':
A[i] = A[i-1];
C[i] = C[i-1];
G[i] = G[i-1] + 3;
T[i] = T[i-1];
break;
case 'T':
A[i] = A[i-1];
C[i] = C[i-1];
G[i] = G[i-1];
T[i] = T[i-1] + 4;
break;
default:
break;
}
}
for(int i=0; i<P.length; i++) {
if(P[i] == 0) {
if(A[Q[i]] > 0)
res[i] =1;
else if(C[Q[i]] > 0)
res[i] =2;
else if(G[Q[i]] > 0)
res[i] =3;
else if(T[Q[i]] > 0)
res[i] =4;
}else {
if(A[Q[i]] - A[P[i]-1] > 0)
res[i] = 1;
else if(C[Q[i]] - C[P[i]-1] > 0)
res[i] = 2;
else if(G[Q[i]] - G[P[i]-1] > 0)
res[i] = 3;
else if(T[Q[i]] - T[P[i]-1] > 0)
res[i] = 4;
}
}
return res;
}
}
Analysis
expand all
Example tests
1.
0.056 s
RUNTIME ERROR,
tested program terminated unexpectedly
stderr:
Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 3 at Solution.solution(Solution.java:43) at Exec.run(exec.java:49) at Exec.main(exec.java:34)
Code: 03:29:12 UTC,
java,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
// write your code in Java SE 8
int[] res = new int[P.length];
int strLength = S.length();
if(P.length != Q.length)
return res;
int[] A = new int[strLength];
int[] C = new int[strLength];
int[] G = new int[strLength];
int[] T = new int[strLength];
switch(S.charAt(0)) {
case 'A':
A[0] = 1;
break;
case 'C':
C[0] = 2;
break;
case 'G':
G[0] = 3;
break;
case 'T':
T[0] = 4;
break;
default:
break;
}
for(int i=1; i<strLength;i++) {
switch(S.charAt(i)) {
case 'A':
A[i] = A[i-1]+1;
C[i] = C[i-1];
G[i] = G[i-1];
T[i] = T[i-1];
break;
case 'C':
A[i] = A[i-1];
C[i] = C[i-1] + 2;
G[i] = G[i-1];
T[i] = T[i-1];
break;
case 'G':
A[i] = A[i-1];
C[i] = C[i-1];
G[i] = G[i-1] + 3;
T[i] = T[i-1];
break;
case 'T':
A[i] = A[i-1];
C[i] = C[i-1];
G[i] = G[i-1];
T[i] = T[i-1] + 4;
break;
default:
break;
}
}
for(int i=0; i<P.length; i++) {
if(P[i] == 0) {
if(A[Q[i]] > 0)
res[i] =1;
else if(C[Q[i]] > 0)
res[i] =2;
else if(G[Q[i]] > 0)
res[i] =3;
else if(T[Q[i]] > 0)
res[i] =4;
}else {
if(A[Q[i]] - A[P[i]-1] > 0)
res[i] = 1;
else if(C[Q[i]] - C[P[i]-1] > 0)
res[i] = 2;
else if(G[Q[i]] - G[P[i]-1] > 0)
res[i] = 3;
else if(T[Q[i]] - T[P[i]-1] > 0)
res[i] = 4;
}
}
return res;
}
}
Analysis
Code: 03:29:24 UTC,
java,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
// write your code in Java SE 8
int[] res = new int[P.length];
int strLength = S.length();
if(P.length != Q.length)
return res;
int[] A = new int[strLength];
int[] C = new int[strLength];
int[] G = new int[strLength];
int[] T = new int[strLength];
switch(S.charAt(0)) {
case 'A':
A[0] = 1;
break;
case 'C':
C[0] = 2;
break;
case 'G':
G[0] = 3;
break;
case 'T':
T[0] = 4;
break;
default:
break;
}
for(int i=1; i<strLength;i++) {
switch(S.charAt(i)) {
case 'A':
A[i] = A[i-1]+1;
C[i] = C[i-1];
G[i] = G[i-1];
T[i] = T[i-1];
break;
case 'C':
A[i] = A[i-1];
C[i] = C[i-1] + 2;
G[i] = G[i-1];
T[i] = T[i-1];
break;
case 'G':
A[i] = A[i-1];
C[i] = C[i-1];
G[i] = G[i-1] + 3;
T[i] = T[i-1];
break;
case 'T':
A[i] = A[i-1];
C[i] = C[i-1];
G[i] = G[i-1];
T[i] = T[i-1] + 4;
break;
default:
break;
}
}
for(int i=0; i<P.length; i++) {
if(P[i] == 0) {
if(A[Q[i]] > 0)
res[i] =1;
else if(C[Q[i]] > 0)
res[i] =2;
else if(G[Q[i]] > 0)
res[i] =3;
else if(T[Q[i]] > 0)
res[i] =4;
}else {
if(A[Q[i]] - A[P[i]-1] > 0)
res[i] = 1;
else if(C[Q[i]] - C[P[i]-1] > 0)
res[i] = 2;
else if(G[Q[i]] - G[P[i]-1] > 0)
res[i] = 3;
else if(T[Q[i]] - T[P[i]-1] > 0)
res[i] = 4;
}
}
return res;
}
}
Analysis
Code: 03:29:35 UTC,
java,
final,
score:
100
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
// write your code in Java SE 8
int[] res = new int[P.length];
int strLength = S.length();
if(P.length != Q.length)
return res;
int[] A = new int[strLength];
int[] C = new int[strLength];
int[] G = new int[strLength];
int[] T = new int[strLength];
switch(S.charAt(0)) {
case 'A':
A[0] = 1;
break;
case 'C':
C[0] = 2;
break;
case 'G':
G[0] = 3;
break;
case 'T':
T[0] = 4;
break;
default:
break;
}
for(int i=1; i<strLength;i++) {
switch(S.charAt(i)) {
case 'A':
A[i] = A[i-1]+1;
C[i] = C[i-1];
G[i] = G[i-1];
T[i] = T[i-1];
break;
case 'C':
A[i] = A[i-1];
C[i] = C[i-1] + 2;
G[i] = G[i-1];
T[i] = T[i-1];
break;
case 'G':
A[i] = A[i-1];
C[i] = C[i-1];
G[i] = G[i-1] + 3;
T[i] = T[i-1];
break;
case 'T':
A[i] = A[i-1];
C[i] = C[i-1];
G[i] = G[i-1];
T[i] = T[i-1] + 4;
break;
default:
break;
}
}
for(int i=0; i<P.length; i++) {
if(P[i] == 0) {
if(A[Q[i]] > 0)
res[i] =1;
else if(C[Q[i]] > 0)
res[i] =2;
else if(G[Q[i]] > 0)
res[i] =3;
else if(T[Q[i]] > 0)
res[i] =4;
}else {
if(A[Q[i]] - A[P[i]-1] > 0)
res[i] = 1;
else if(C[Q[i]] - C[P[i]-1] > 0)
res[i] = 2;
else if(G[Q[i]] - G[P[i]-1] > 0)
res[i] = 3;
else if(T[Q[i]] - T[P[i]-1] > 0)
res[i] = 4;
}
}
return res;
}
}Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N + M)
expand all
Correctness tests
1.
0.071 s
OK
2.
0.030 s
OK
3.
0.064 s
OK
4.
0.060 s
OK
1.
0.032 s
OK
2.
0.034 s
OK
3.
0.053 s
OK
4.
0.096 s
OK
1.
0.031 s
OK
2.
0.031 s
OK
3.
0.047 s
OK
1.
0.031 s
OK
1.
0.198 s
OK