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–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used PHP
Time spent on task 6 minutes
Notes
not defined yet
Code: 12:55:22 UTC,
php,
verify,
result: Passed
// you can use print for debugging purposes, e.g.
// print "this is a debug message\n";
function solution($A)
{
// this can be also solved with
// return count(array_unique($A));
// array which contains distinct values of array $A
$distinct = array();
foreach($A as $value)
{
// saving distinct values by key ensures uniqueness
if(empty($distinct[$value]))
$distinct[$value] = $value;
}
// number of distinct values in array $A
$distinctCount = count($distinct);
return $distinctCount;
}
Analysis
Analysis
Analysis
Analysis
Analysis
Analysis
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N*log(N)) or O(N)
expand all
Correctness tests
1.
0.027 s
OK
1.
0.029 s
OK
2.
0.025 s
OK
1.
0.025 s
OK
1.
0.026 s
OK
1.
0.025 s
OK
1.
0.026 s
OK
1.
0.026 s
OK
1.
0.027 s
OK
1.
0.028 s
OK