Tasks Details
easy
Find value that occurs in odd number of elements.
Task Score
100%
Correctness
100%
Performance
100%
A non-empty array A consisting of N integers is given. The array contains an odd number of elements, and each element of the array can be paired with another element that has the same value, except for one element that is left unpaired.
For example, in array A such that:
A[0] = 9 A[1] = 3 A[2] = 9 A[3] = 3 A[4] = 9 A[5] = 7 A[6] = 9
- the elements at indexes 0 and 2 have value 9,
- the elements at indexes 1 and 3 have value 3,
- the elements at indexes 4 and 6 have value 9,
- the element at index 5 has value 7 and is unpaired.
Write a function:
function solution(A);
that, given an array A consisting of N integers fulfilling the above conditions, returns the value of the unpaired element.
For example, given array A such that:
A[0] = 9 A[1] = 3 A[2] = 9 A[3] = 3 A[4] = 9 A[5] = 7 A[6] = 9the function should return 7, as explained in the example above.
Write an efficient algorithm for the following assumptions:
- N is an odd integer within the range [1..1,000,000];
- each element of array A is an integer within the range [1..1,000,000,000];
- all but one of the values in A occur an even number of times.
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 13 minutes
Notes
not defined yet
Task timeline
Code: 08:08:31 UTC,
java,
autosave
Code: 08:10:35 UTC,
js,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.120 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: arrays is not defined at A.sort.find (solution.js:5:62) at Array.find (native) at solution (solution.js:5:20) at solutionWrapper (/tmp/exec.js:402:28) at Promise.resolve.then (/tmp/exec.js:428:24) at <anonymous> at process._tickCallback (internal/process/next_tick.js:188:7) at Function.Module.runMain (module.js:686:11) at startup (bootstrap_node.js:187:16) at bootstrap_node.js:608:3
Code: 08:10:44 UTC,
js,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.072 s
WRONG ANSWER,
got 3 expected 7
Code: 08:11:45 UTC,
js,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.068 s
WRONG ANSWER,
got 3 expected 7
Code: 08:19:22 UTC,
js,
autosave
Code: 08:19:36 UTC,
js,
verify,
result: Passed
Analysis
Code: 08:19:52 UTC,
js,
autosave
Code: 08:20:20 UTC,
js,
autosave
Code: 08:20:38 UTC,
js,
autosave
Code: 08:20:53 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A = []) {
if (A.length === 1) {
return A[0];
}
return A.sort().find((num, index, arrays) => {
if (index % 2 === 0) {
return num !== arrays[index + 1];
} else {
return false;
}
});
}
Code: 08:21: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 = []) {
if (A.length === 1) {
return A[0];
}
return A.sort().find((num, index, arrays) => {
if (index % 2 === 0) {
return num !== arrays[index + 1];
} else {
return false;
}
});
}
Analysis
Code: 08:21:11 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 = []) {
if (A.length === 1) {
return A[0];
}
return A.sort().find((num, index, arrays) => {
if (index % 2 === 0) {
return num !== arrays[index + 1];
} else {
return false;
}
});
}
Analysis
Code: 08:21:13 UTC,
js,
final,
score: 
100
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A = []) {
if (A.length === 1) {
return A[0];
}
return A.sort().find((num, index, arrays) => {
if (index % 2 === 0) {
return num !== arrays[index + 1];
} else {
return false;
}
});
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N) or O(N*log(N))