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:
class Solution { public int solution(int[] 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 Java 8
Time spent on task 10 minutes
Notes
not defined yet
Task timeline
Code: 03:51:10 UTC,
java,
autosave
Code: 03:51:38 UTC,
java,
autosave
// you can also use imports, for example:
import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
if(A.length == 0) {
return 1;
}
}
}
Code: 03:51:49 UTC,
java,
autosave
// you can also use imports, for example:
import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
if(A.length == 0) {
return 1;
}
}
}
Code: 03:56:07 UTC,
java,
autosave
// you can also use imports, for example:
import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
if(A.length == 0) {
return 1;
}
B
}
}
Code: 03:56:23 UTC,
java,
autosave
// you can also use imports, for example:
import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
if(A.length == 0) {
return 1;
}
BitSet bs = new BitSet();
}
}
Code: 03:56:53 UTC,
java,
autosave
// you can also use imports, for example:
import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
if(A.length == 0) {
return 1;
}
BitSet bs = new BitSet();
for (int i = 0; i < A.length; i++) {
bs.set(A[i]);
}
}
}
Code: 03:57:23 UTC,
java,
autosave
// you can also use imports, for example:
import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
if(A.length == 0) {
return 1;
}
BitSet bs = new BitSet();
for (int i = 0; i < A.length; i++) {
bs.set(A[i]);
}
int ret = -1;
for (int i = 1; i < A)
}
}
Code: 03:57:54 UTC,
java,
autosave
// you can also use imports, for example:
import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
if(A.length == 0) {
return 1;
}
BitSet bs = new BitSet();
for (int i = 0; i < A.length; i++) {
bs.set(A[i]);
}
int ret = -1;
for (int i = 1; i < A.length + 1; i++) {
if (!bs.get(i)) {
re
}
}
}
}
Code: 03:58:05 UTC,
java,
autosave
// you can also use imports, for example:
import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
if(A.length == 0) {
return 1;
}
BitSet bs = new BitSet();
for (int i = 0; i < A.length; i++) {
bs.set(A[i]);
}
int ret = -1;
for (int i = 1; i < A.length + 1; i++) {
if (!bs.get(i)) {
ret = i;
}
}
}
}
Code: 03:58:20 UTC,
java,
verify,
result: Passed
// you can also use imports, for example:
import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
if(A.length == 0) {
return 1;
}
BitSet bs = new BitSet();
for (int i = 0; i < A.length; i++) {
bs.set(A[i]);
}
int ret = -1;
for (int i = 1; i < A.length + 1; i++) {
if (!bs.get(i)) {
ret = i;
break;
}
}
return ret;
}
}
Analysis
Code: 03:58:36 UTC,
java,
autosave
// you can also use imports, for example:
import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
if(A.length == 0) {
return 1;
}
BitSet bs = new BitSet();
for (int i = 0; i < A.length; i++) {
bs.set(A[i]);
}
int ret = -1;
for (int i = 1; i < A.length + 1; i++) {
if (!bs.get(i)) {
ret = i;
break;
}
}
return ret;
}
}
Code: 03:59:07 UTC,
java,
autosave
// you can also use imports, for example:
import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
if(A.length == 0) {
return 1;
}
BitSet bs = new BitSet();
for (int i = 0; i < A.length; i++) {
bs.set(A[i]);
}
int ret = -1;
for (int i = 1; i < A.length + 1; i++) {
if (!bs.get(i)) {
ret = i;
break;
}
}
return ret;
}
}
Code: 03:59:17 UTC,
java,
autosave
// you can also use imports, for example:
import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
if(A.length == 0) {
return 1;
}
BitSet bs = new BitSet();
for (int i = 0; i < A.length; i++) {
bs.set(A[i]);
}
int ret = -1;
for (int i = 1; i < A.length + 1; i++) {
if (!bs.get(i)) {
ret = i;
break;
}
}
return ret;
}
}
Code: 03:59:30 UTC,
java,
autosave
// you can also use imports, for example:
import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
if(A.length == 0) {
return 1;
}
BitSet bs = new BitSet();
for (int i = 0; i < A.length; i++) {
bs.set(A[i]);
}
int ret = -1;
for (int i = 1; i < A.length + 1; i++) {
if (!bs.get(i)) {
ret = i;
break;
}
}
return ret;
}
}
Code: 03:59:38 UTC,
java,
verify,
result: Passed
// you can also use imports, for example:
import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
if(A.length == 0) {
return 1;
}
BitSet bs = new BitSet();
for (int i = 0; i < A.length; i++) {
bs.set(A[i]);
}
int ret = -1;
for (int i = 1; i < A.length + 1; i++) {
if (!bs.get(i)) {
ret = i;
break;
}
}
return ret;
}
}
User test case 1:
[1, 2, 3, 4, 5]
User test case 2:
[5, 4, 3, 2, 1]
User test case 3:
[]
User test case 4:
[5, 4, 2, 1]
User test case 5:
[5, 4, 3, 2]
Analysis
Code: 04:00:20 UTC,
java,
autosave
// you can also use imports, for example:
import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
if(A.length == 0) {
return 1;
}
BitSet bs = new BitSet();
for (int i = 0; i < A.length; i++) {
bs.set(A[i]);
}
int ret = -1;
for (int i = 1; i <= A.length + 1; i++) {
if (!bs.get(i)) {
ret = i;
break;
}
}
return ret;
}
}
Code: 04:00:21 UTC,
java,
verify,
result: Passed
// you can also use imports, for example:
import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
if(A.length == 0) {
return 1;
}
BitSet bs = new BitSet();
for (int i = 0; i < A.length; i++) {
bs.set(A[i]);
}
int ret = -1;
for (int i = 1; i <= A.length + 1; i++) {
if (!bs.get(i)) {
ret = i;
break;
}
}
return ret;
}
}
User test case 1:
[1, 2, 3, 4, 5]
User test case 2:
[5, 4, 3, 2, 1]
User test case 3:
[]
User test case 4:
[5, 4, 2, 1]
User test case 5:
[5, 4, 3, 2]
Analysis
Code: 04:00:35 UTC,
java,
verify,
result: Passed
// you can also use imports, for example:
import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
if(A.length == 0) {
return 1;
}
BitSet bs = new BitSet();
for (int i = 0; i < A.length; i++) {
bs.set(A[i]);
}
int ret = -1;
for (int i = 1; i <= A.length + 1; i++) {
if (!bs.get(i)) {
ret = i;
break;
}
}
return ret;
}
}
User test case 1:
[1, 2, 3, 4, 5]
User test case 2:
[5, 4, 3, 2, 1]
User test case 3:
[]
User test case 4:
[5, 4, 2, 1]
User test case 5:
[5, 4, 3, 2]
Analysis
Code: 04:00:43 UTC,
java,
final,
score: 
100
// you can also use imports, for example:
import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
if(A.length == 0) {
return 1;
}
BitSet bs = new BitSet();
for (int i = 0; i < A.length; i++) {
bs.set(A[i]);
}
int ret = -1;
for (int i = 1; i <= A.length + 1; i++) {
if (!bs.get(i)) {
ret = i;
break;
}
}
return ret;
}
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N) or O(N * log(N))
expand all
Correctness tests
1.
0.008 s
OK
2.
0.008 s
OK
1.
0.008 s
OK
2.
0.008 s
OK
1.
0.008 s
OK
2.
0.008 s
OK
1.
0.004 s
OK
2.
0.008 s
OK
3.
0.008 s
OK
1.
0.008 s
OK
expand all
Performance tests
1.
0.032 s
OK
1.
0.032 s
OK
1.
0.292 s
OK
2.
0.136 s
OK
3.
0.140 s
OK
1.
0.288 s
OK
1.
0.168 s
OK