Tasks Details
easy
Find the missing element in a given permutation.
Task Score
100%
Correctness
100%
Performance
100%
An array A consisting of N different integers is given. The array contains integers in the range [1..(N + 1)], which means that exactly one element is missing.
Your goal is to find that missing element.
Write a function:
function solution(A);
that, given an array A, returns the value of the missing element.
For example, given array A such that:
A[0] = 2 A[1] = 3 A[2] = 1 A[3] = 5the function should return 4, as it is the missing element.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [0..100,000];
- the elements of A are all distinct;
- each element of array A is an integer within the range [1..(N + 1)].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 7 minutes
Notes
not defined yet
Task timeline
Code: 06:29:58 UTC,
java,
autosave
Code: 06:35:16 UTC,
js,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.072 s
WRONG ANSWER,
got 1 expected 4
Code: 06:35:34 UTC,
js,
autosave
Code: 06:35:53 UTC,
js,
autosave
// 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 8.9.4)
let number = 0;
for(let i = 0; i < A.length; ++i) {
number ^= (i + 1) ^ A[i];
}
return number ^ A.length + 1;
}
Code: 06:35:55 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 8.9.4)
let number = 0;
for(let i = 0; i < A.length; ++i) {
number ^= (i + 1) ^ A[i];
}
return number ^ (A.length + 1);
}
Analysis
Code: 06:36:01 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 8.9.4)
let number = 0;
for(let i = 0; i < A.length; ++i) {
number ^= (i + 1) ^ A[i];
}
return number ^ (A.length + 1);
}
Analysis
Code: 06:36:04 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) {
// write your code in JavaScript (Node.js 8.9.4)
let number = 0;
for(let i = 0; i < A.length; ++i) {
number ^= (i + 1) ^ A[i];
}
return number ^ (A.length + 1);
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N) or O(N * log(N))
expand all
Correctness tests
1.
0.068 s
OK
2.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
1.
0.068 s
OK
expand all
Performance tests
1.
0.080 s
OK
1.
0.080 s
OK
1.
0.108 s
OK
2.
0.096 s
OK
3.
0.096 s
OK
1.
0.108 s
OK
1.
0.100 s
OK