Tasks Details
medium
Find the smallest positive integer that does not occur in a given sequence.
Task Score
100%
Correctness
100%
Performance
100%
This is a demo task.
Write a function:
class Solution { public int solution(int[] A); }
that, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A.
For example, given A = [1, 3, 6, 4, 1, 2], the function should return 5.
Given A = [1, 2, 3], the function should return 4.
Given A = [−1, −3], the function should return 1.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..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 Java 8
Total time used 4 minutes
Effective time used 4 minutes
Notes
not defined yet
Task timeline
Code: 06:55:47 UTC,
java,
autosave
Code: 06:58:55 UTC,
swift3,
verify,
result: Passed
Analysis
Code: 06:59:08 UTC,
swift3,
verify,
result: Passed
Analysis
Code: 06:59:11 UTC,
swift3,
final,
score: 
100
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N) or O(N * log(N))
expand all
Correctness tests
1.
0.032 s
OK
2.
0.028 s
OK
3.
0.032 s
OK
4.
0.032 s
OK
1.
0.032 s
OK
2.
0.032 s
OK
3.
0.032 s
OK
1.
0.032 s
OK
2.
0.032 s
OK
1.
0.032 s
OK
2.
0.032 s
OK
1.
0.032 s
OK
expand all
Performance tests
1.
0.036 s
OK
2.
0.036 s
OK
3.
0.040 s
OK
1.
0.108 s
OK
1.
0.152 s
OK
2.
0.136 s
OK
1.
0.076 s
OK