[level 0] 가까운 1 찾기

function solution(arr, idx) {
    for (let i = idx; i < arr.length; i++) {
        if (arr[i] === 1) return i;
    }
    return -1;
}