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 PHP
Total time used 3 minutes
Effective time used 3 minutes
Notes
not defined yet
Task timeline
Code: 03:22:45 UTC,
java,
autosave
Code: 03:24:05 UTC,
php,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.004 s
WRONG ANSWER,
got 6 expected 3
Code: 03:24:24 UTC,
php,
autosave
Code: 03:24:33 UTC,
php,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.004 s
WRONG ANSWER,
got 6 expected 3
Code: 03:24:39 UTC,
php,
verify,
result: Passed
Analysis
Code: 03:24:47 UTC,
php,
verify,
result: Passed
Analysis
Code: 03:24:49 UTC,
php,
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.004 s
OK
1.
0.004 s
OK
2.
0.004 s
OK
1.
0.004 s
OK
1.
0.004 s
OK
1.
0.004 s
OK
1.
0.004 s
OK
1.
0.004 s
OK
1.
0.004 s
OK
1.
0.004 s
OK