Tasks Details
easy
1.
Distinct
Compute number of distinct values in an array.
Task Score
100%
Correctness
100%
Performance
100%
Write a function
function solution(A);
that, given an array A consisting of N integers, returns the number of distinct values in array A.
For example, given array A consisting of six elements such that:
A[0] = 2 A[1] = 1 A[2] = 1 A[3] = 2 A[4] = 3 A[5] = 1the function should return 3, because there are 3 distinct values appearing in array A, namely 1, 2 and 3.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−1,000,000..1,000,000].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 3 minutes
Notes
not defined yet
Task timeline
Code: 14:00:53 UTC,
js,
verify,
result: Passed
Analysis
Code: 14:01:07 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 4.0.0)
A.sort();
var count=0;
for(var i=0;i<A.length;i++){
if(A[i] != A[i+1]) count++;
}
return count;
}
User test case 1:
[1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 1]
Analysis
Code: 14:01:30 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 4.0.0)
A.sort();
var count=0;
for(var i=0;i<A.length;i++){
if(A[i] != A[i+1]) count++;
}
return count;
}
User test case 1:
[1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 1]
User test case 2:
[]
User test case 3:
[1]
User test case 4:
[1, 1]
User test case 5:
[-1, 1, 0]
User test case 6:
[1, 2, 3]
User test case 7:
[-1, -2]
Analysis
expand all
User tests
1.
0.158 s
OK
function result: 5
function result: 5
1.
0.158 s
OK
function result: 0
function result: 0
1.
0.157 s
OK
function result: 1
function result: 1
1.
0.157 s
OK
function result: 1
function result: 1
1.
0.160 s
OK
function result: 3
function result: 3
1.
0.161 s
OK
function result: 3
function result: 3
1.
0.159 s
OK
function result: 2
function result: 2
Code: 14:01:49 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 4.0.0)
A.sort();
var count=0;
for(var i=0;i<A.length;i++){
if(A[i] != A[i+1]) count++;
}
return count;
}
User test case 1:
[1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 1]
User test case 2:
[]
User test case 3:
[1]
User test case 4:
[1, 1]
User test case 5:
[-1, 1, 0]
User test case 6:
[1, 2, 3]
User test case 7:
[-1, -2]
Analysis
expand all
User tests
1.
0.165 s
OK
function result: 5
function result: 5
1.
0.161 s
OK
function result: 0
function result: 0
1.
0.159 s
OK
function result: 1
function result: 1
1.
0.161 s
OK
function result: 1
function result: 1
1.
0.161 s
OK
function result: 3
function result: 3
1.
0.158 s
OK
function result: 3
function result: 3
1.
0.161 s
OK
function result: 2
function result: 2
Code: 14:01:54 UTC,
js,
final,
score:
100
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N*log(N)) or O(N)
expand all
Correctness tests
1.
0.163 s
OK
1.
0.161 s
OK
2.
0.163 s
OK
1.
0.164 s
OK
1.
0.160 s
OK
1.
0.159 s
OK
1.
0.160 s
OK
1.
0.164 s
OK
1.
0.167 s
OK
1.
0.166 s
OK