Created
February 21, 2018 01:58
-
-
Save tuttelikz/9d3c05d52da047347d3e5905041aa7cf to your computer and use it in GitHub Desktop.
Clova Task
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This is a demo task. | |
Write a function: | |
int solution(vector<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. | |
Assume that: | |
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]. | |
Complexity: | |
expected worst-case time complexity is O(N); | |
expected worst-case space complexity is O(N), beyond input storage (not counting the storage required for input arguments). | |
Copyright 2009–2018 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited. | |
/////////////////////////////////////////////////////////////////////////////////////// | |
// you can use includes, for example: | |
// #include <algorithm> | |
// you can write to stdout for debugging purposes, e.g. | |
// cout << "this is a debug message" << endl; | |
int solution(vector<int> &A) { | |
// write your code in C++14 (g++ 6.2.0) | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment