PermMissingElem
Find missing element in a given permutation.
Solution
int solution(vector<int> &A) { // write your code in C++11 (g++ 4.8.2) int res = 0; for (int i = 0; i < int(A.size()); i++) { res += (i + 1 - A[i]); } res += int(A.size() + 1); return res;}
Output
https://codility.com/demo/results/trainingWHSJBD-BGA/