Codility #10-FrogRiverOne

function solution(X, A) {

let numbers = new Set();

for (let i = 0, n = A.length; i < n; i++) {

numbers.add(A[i]);

if (X === numbers.size) {

return i;

}

}

return -1;

}