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 9 minutes
Notes
not defined yet
Task timeline
Code: 02:03:10 UTC,
java,
autosave
Code: 02:04:26 UTC,
java,
autosave
Code: 02:04:37 UTC,
java,
autosave
Code: 02:06:29 UTC,
java,
autosave
Code: 02:06:55 UTC,
java,
autosave
// 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) {
int[] result = new int[P.length];
int[] A = new int[S.length + 1];
int[] C = new int[S.length + 1];
int[] G = new int[S.length + 1];
return result;
}
}
Code: 02:07:07 UTC,
java,
autosave
// 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) {
int[] result = new int[P.length];
// All array is start 0.
int[] A = new int[S.length + 1];
int[] C = new int[S.length + 1];
int[] G = new int[S.length + 1];
return result;
}
}
Code: 02:07:23 UTC,
java,
autosave
// 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) {
int[] result = new int[P.length];
// All array is start 0. (Check for changing character is exists.)
int[] A = new int[S.length + 1];
int[] C = new int[S.length + 1];
int[] G = new int[S.length + 1];
return result;
}
}
Code: 02:07:53 UTC,
java,
autosave
// 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) {
int[] result = new int[P.length];
// All array is start 0. (Check for changing character is exists.)
int[] A = new int[S.length + 1];
int[] C = new int[S.length + 1];
int[] G = new int[S.length + 1];
for (int idx = 0; idx < S.length(); idx++) {
A[idx + 1] = A[idx];
C[idx + 1] = A[idx];
A[idx + 1] = A[idx];
}
return result;
}
}
Code: 02:08:23 UTC,
java,
autosave
// 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) {
int[] result = new int[P.length];
// All array is start 0. (Check for changing character is exists.)
int[] A = new int[S.length + 1];
int[] C = new int[S.length + 1];
int[] G = new int[S.length + 1];
for (int idx = 0; idx < S.length(); idx++) {
A[idx + 1] = A[idx];
C[idx + 1] = C[idx];
G[idx + 1] = G[idx];
switch(S.charAt(idx)) {
case 'A': break;
case 'C': break;
case 'G': break;
}
}
return result;
}
}
Code: 02:08:53 UTC,
java,
autosave
// 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) {
int[] result = new int[P.length];
// All array is start 0. (Check for changing character is exists.)
int[] A = new int[S.length + 1];
int[] C = new int[S.length + 1];
int[] G = new int[S.length + 1];
for (int idx = 0; idx < S.length(); idx++) {
A[idx + 1] = A[idx];
C[idx + 1] = C[idx];
G[idx + 1] = G[idx];
switch(S.charAt(idx)) {
case 'A': A[idx + 1]++; break;
case 'C': C[idx + 1]++; break;
case 'G': break;
default: break;
}
}
return result;
}
}
Code: 02:09:24 UTC,
java,
autosave
// 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) {
int[] result = new int[P.length];
// All array is start 0. (Check for changing character is exists.)
int[] A = new int[S.length + 1];
int[] C = new int[S.length + 1];
int[] G = new int[S.length + 1];
// Initializing each array.
for (int idx = 0; idx < S.length(); idx++) {
A[idx + 1] = A[idx];
C[idx + 1] = C[idx];
G[idx + 1] = G[idx];
switch(S.charAt(idx)) {
case 'A': A[idx + 1]++; break;
case 'C': C[idx + 1]++; break;
case 'G': G[idx + 1]++; break;
default: break;
}
}
for (int idx = 0; idx < P.length; idx++)
return result;
}
}
Code: 02:09:34 UTC,
java,
autosave
// 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) {
int[] result = new int[P.length];
// All array is start 0. (Check for changing character is exists.)
int[] A = new int[S.length + 1];
int[] C = new int[S.length + 1];
int[] G = new int[S.length + 1];
// Initializing each array.
for (int idx = 0; idx < S.length(); idx++) {
A[idx + 1] = A[idx];
C[idx + 1] = C[idx];
G[idx + 1] = G[idx];
switch(S.charAt(idx)) {
case 'A': A[idx + 1]++; break;
case 'C': C[idx + 1]++; break;
case 'G': G[idx + 1]++; break;
default: break;
}
}
for (int idx = 0; idx < P.length; idx++) {
if ()
}
return result;
}
}
Code: 02:09:45 UTC,
java,
autosave
// 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) {
int[] result = new int[P.length];
// All array is start 0. (Check for changing character is exists.)
int[] A = new int[S.length + 1];
int[] C = new int[S.length + 1];
int[] G = new int[S.length + 1];
// Initializing each array.
for (int idx = 0; idx < S.length(); idx++) {
A[idx + 1] = A[idx];
C[idx + 1] = C[idx];
G[idx + 1] = G[idx];
switch(S.charAt(idx)) {
case 'A': A[idx + 1]++; break;
case 'C': C[idx + 1]++; break;
case 'G': G[idx + 1]++; break;
default: break;
}
}
for (int idx = 0; idx < P.length; idx++) {
if (A[P])
}
return result;
}
}
Code: 02:10:04 UTC,
java,
autosave
// 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) {
int[] result = new int[P.length];
// All array is start 0. (Check for changing character is exists.)
int[] A = new int[S.length + 1];
int[] C = new int[S.length + 1];
int[] G = new int[S.length + 1];
// Initializing each array.
for (int idx = 0; idx < S.length(); idx++) {
A[idx + 1] = A[idx];
C[idx + 1] = C[idx];
G[idx + 1] = G[idx];
switch(S.charAt(idx)) {
case 'A': A[idx + 1]++; break;
case 'C': C[idx + 1]++; break;
case 'G': G[idx + 1]++; break;
default: break;
}
}
for (int idx = 0; idx < P.length; idx++) {
if (A[P[idx]] != A[Q[idx] + 1]) {
}
}
return result;
}
}
Code: 02:10:21 UTC,
java,
autosave
// 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) {
int[] result = new int[P.length];
// All array is start 0. (Check for changing character is exists.)
int[] A = new int[S.length + 1];
int[] C = new int[S.length + 1];
int[] G = new int[S.length + 1];
// Initializing each array.
for (int idx = 0; idx < S.length(); idx++) {
A[idx + 1] = A[idx];
C[idx + 1] = C[idx];
G[idx + 1] = G[idx];
switch(S.charAt(idx)) {
case 'A': A[idx + 1]++; break;
case 'C': C[idx + 1]++; break;
case 'G': G[idx + 1]++; break;
default: break;
}
}
for (int idx = 0; idx < P.length; idx++) {
if (A[P[idx]] != A[Q[idx] + 1]) {
result[idx] = 1;
} else if () {
}
}
return result;
}
}
Code: 02:10:34 UTC,
java,
autosave
// 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) {
int[] result = new int[P.length];
// All array is start 0. (Check for changing character is exists.)
int[] A = new int[S.length + 1];
int[] C = new int[S.length + 1];
int[] G = new int[S.length + 1];
// Initializing each array.
for (int idx = 0; idx < S.length(); idx++) {
A[idx + 1] = A[idx];
C[idx + 1] = C[idx];
G[idx + 1] = G[idx];
switch(S.charAt(idx)) {
case 'A': A[idx + 1]++; break;
case 'C': C[idx + 1]++; break;
case 'G': G[idx + 1]++; break;
default: break;
}
}
for (int idx = 0; idx < P.length; idx++) {
if (A[P[idx]] != A[Q[idx] + 1]) {
result[idx] = 1;
} else if (C[P[idx]] != C[Q[idx] + 1]) {
result[idx] = 2;
}
}
return result;
}
}
Code: 02:10:52 UTC,
java,
autosave
// 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) {
int[] result = new int[P.length];
// All array is start 0. (Check for changing character is exists.)
int[] A = new int[S.length + 1];
int[] C = new int[S.length + 1];
int[] G = new int[S.length + 1];
// Initializing each array.
for (int idx = 0; idx < S.length(); idx++) {
A[idx + 1] = A[idx];
C[idx + 1] = C[idx];
G[idx + 1] = G[idx];
switch(S.charAt(idx)) {
case 'A': A[idx + 1]++; break;
case 'C': C[idx + 1]++; break;
case 'G': G[idx + 1]++; break;
default: break;
}
}
for (int idx = 0; idx < P.length; idx++) {
if (A[P[idx]] != A[Q[idx] + 1]) {
result[idx] = 1;
} else if (C[P[idx]] != C[Q[idx] + 1]) {
result[idx] = 2;
} else if (G[P[idx]] != G[Q[idx] + 1]) {
result[idx] = 3;
} else {
result[idx] = 4;
}
}
return result;
}
}
Code: 02:11:08 UTC,
java,
autosave
// 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) {
int[] result = new int[P.length];
// All array is start 0. (Check for changing character is exists.)
int[] A = new int[S.length + 1];
int[] C = new int[S.length + 1];
int[] G = new int[S.length + 1];
// Initializing each array.
for (int idx = 0; idx < S.length(); idx++) {
A[idx + 1] = A[idx];
C[idx + 1] = C[idx];
G[idx + 1] = G[idx];
switch(S.charAt(idx)) {
case 'A': A[idx + 1]++; break;
case 'C': C[idx + 1]++; break;
case 'G': G[idx + 1]++; break;
default: break;
}
}
// Check for contains word in P and Q.
for (int idx = 0; idx < P.length; idx++) {
if (A[P[idx]] != A[Q[idx] + 1]) {
result[idx] = 1;
} else if (C[P[idx]] != C[Q[idx] + 1]) {
result[idx] = 2;
} else if (G[P[idx]] != G[Q[idx] + 1]) {
result[idx] = 3;
} else {
result[idx] = 4;
}
}
return result;
}
}
Code: 02:11:20 UTC,
java,
verify,
result: Failed
// 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) {
int[] result = new int[P.length];
// All array is start 0. (Check for changing character is exists.)
int[] A = new int[S.length + 1];
int[] C = new int[S.length + 1];
int[] G = new int[S.length + 1];
// Initializing each array.
for (int idx = 0; idx < S.length(); idx++) {
A[idx + 1] = A[idx];
C[idx + 1] = C[idx];
G[idx + 1] = G[idx];
switch(S.charAt(idx)) {
case 'A': A[idx + 1]++; break;
case 'C': C[idx + 1]++; break;
case 'G': G[idx + 1]++; break;
default: break;
}
}
// Check for contains word in P and Q.
for (int idx = 0; idx < P.length; idx++) {
if (A[P[idx]] != A[Q[idx] + 1]) {
result[idx] = 1;
} else if (C[P[idx]] != C[Q[idx] + 1]) {
result[idx] = 2;
} else if (G[P[idx]] != G[Q[idx] + 1]) {
result[idx] = 3;
} else {
result[idx] = 4;
}
}
return result;
}
}
Analysis
Compile error
Solution.java:11: error: cannot find symbol
int[] A = new int[S.length + 1];
^
symbol: variable length
location: variable S of type String
Solution.java:12: error: cannot find symbol
int[] C = new int[S.length + 1];
^
symbol: variable length
location: variable S of type String
Solution.java:13: error: cannot find symbol
int[] G = new int[S.length + 1];
^
symbol: variable length
location: variable S of type String
3 errors
Code: 02:11:41 UTC,
java,
autosave
// 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) {
int[] result = new int[P.length];
// All array is start 0. (Check for changing character is exists.)
int[] A = new int[S.length() + 1];
int[] C = new int[S.length + 1];
int[] G = new int[S.length + 1];
// Initializing each array.
for (int idx = 0; idx < S.length(); idx++) {
A[idx + 1] = A[idx];
C[idx + 1] = C[idx];
G[idx + 1] = G[idx];
switch(S.charAt(idx)) {
case 'A': A[idx + 1]++; break;
case 'C': C[idx + 1]++; break;
case 'G': G[idx + 1]++; break;
default: break;
}
}
// Check for contains word in P and Q.
for (int idx = 0; idx < P.length; idx++) {
if (A[P[idx]] != A[Q[idx] + 1]) {
result[idx] = 1;
} else if (C[P[idx]] != C[Q[idx] + 1]) {
result[idx] = 2;
} else if (G[P[idx]] != G[Q[idx] + 1]) {
result[idx] = 3;
} else {
result[idx] = 4;
}
}
return result;
}
}
Code: 02:11:49 UTC,
java,
verify,
result: Passed
// 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) {
int[] result = new int[P.length];
// All array is start 0. (Check for changing character is exists.)
int[] A = new int[S.length() + 1];
int[] C = new int[S.length() + 1];
int[] G = new int[S.length() + 1];
// Initializing each array.
for (int idx = 0; idx < S.length(); idx++) {
A[idx + 1] = A[idx];
C[idx + 1] = C[idx];
G[idx + 1] = G[idx];
switch(S.charAt(idx)) {
case 'A': A[idx + 1]++; break;
case 'C': C[idx + 1]++; break;
case 'G': G[idx + 1]++; break;
default: break;
}
}
// Check for contains word in P and Q.
for (int idx = 0; idx < P.length; idx++) {
if (A[P[idx]] != A[Q[idx] + 1]) {
result[idx] = 1;
} else if (C[P[idx]] != C[Q[idx] + 1]) {
result[idx] = 2;
} else if (G[P[idx]] != G[Q[idx] + 1]) {
result[idx] = 3;
} else {
result[idx] = 4;
}
}
return result;
}
}
Analysis
Code: 02:11:57 UTC,
java,
verify,
result: Passed
// 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) {
int[] result = new int[P.length];
// All array is start 0. (Check for changing character is exists.)
int[] A = new int[S.length() + 1];
int[] C = new int[S.length() + 1];
int[] G = new int[S.length() + 1];
// Initializing each array.
for (int idx = 0; idx < S.length(); idx++) {
A[idx + 1] = A[idx];
C[idx + 1] = C[idx];
G[idx + 1] = G[idx];
switch(S.charAt(idx)) {
case 'A': A[idx + 1]++; break;
case 'C': C[idx + 1]++; break;
case 'G': G[idx + 1]++; break;
default: break;
}
}
// Check for contains word in P and Q.
for (int idx = 0; idx < P.length; idx++) {
if (A[P[idx]] != A[Q[idx] + 1]) {
result[idx] = 1;
} else if (C[P[idx]] != C[Q[idx] + 1]) {
result[idx] = 2;
} else if (G[P[idx]] != G[Q[idx] + 1]) {
result[idx] = 3;
} else {
result[idx] = 4;
}
}
return result;
}
}
Analysis
Code: 02:12:02 UTC,
java,
final,
score:
100
// 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) {
int[] result = new int[P.length];
// All array is start 0. (Check for changing character is exists.)
int[] A = new int[S.length() + 1];
int[] C = new int[S.length() + 1];
int[] G = new int[S.length() + 1];
// Initializing each array.
for (int idx = 0; idx < S.length(); idx++) {
A[idx + 1] = A[idx];
C[idx + 1] = C[idx];
G[idx + 1] = G[idx];
switch(S.charAt(idx)) {
case 'A': A[idx + 1]++; break;
case 'C': C[idx + 1]++; break;
case 'G': G[idx + 1]++; break;
default: break;
}
}
// Check for contains word in P and Q.
for (int idx = 0; idx < P.length; idx++) {
if (A[P[idx]] != A[Q[idx] + 1]) {
result[idx] = 1;
} else if (C[P[idx]] != C[Q[idx] + 1]) {
result[idx] = 2;
} else if (G[P[idx]] != G[Q[idx] + 1]) {
result[idx] = 3;
} else {
result[idx] = 4;
}
}
return result;
}
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N + M)
expand all
Correctness tests
1.
0.008 s
OK
2.
0.008 s
OK
3.
0.008 s
OK
4.
0.008 s
OK
1.
0.008 s
OK
2.
0.008 s
OK
3.
0.008 s
OK
4.
0.008 s
OK
1.
0.008 s
OK
2.
0.004 s
OK
3.
0.008 s
OK
1.
0.008 s
OK
1.
0.008 s
OK