gistfile1.txt

function canJump(arr,d){
    if (arr.length < d){ 
        return true;
    }
    
    let pos = -1;
    for (let i = 0 ; i < arr.length; i++){
        if (arr[i] && i-pos <= d)
            pos = i;
    }
    if (arr.length - pos > d)
        return false;
    else
        return true;
}


function solution(A, D) {
    // write your code in JavaScript (Node.js 6.4.0)
    let t = 0;
    
    let max = -1;
    for (let i = 0; i < A.length; i++){
        if (A[i] > max)
            max = A[i];
    }
    
    while (t <= max){
        let arr = [];
        for (var i = 0; i < A.length; i++){
            if (A[i]>=0 && A[i]<=t))
                arr[i] = 1;
            else
                arr[i] = 0;
        }
        if (canJump(arr, D))
            return t;
        else {  
           t++;
        }
    }  
    
    return -1;
}