FrogRiverOne 100% Solution in Javascript
Question
My Solution
function solution(X, A) { let count = []; let maxDist = 0; for (let i = 0; i < A.length; i++) { if (count[A[i]] === undefined) count[A[i]] = 1; while(count[maxDist+1] === 1) maxDist++; if (maxDist === X) return i; } return -1; }