binaryGap.js

function solution(N) {
    if (N < 1) {
        return 0;
    }
    var start = 0;
    var gap = 0;
    var count = 0;

    for (i = 0; i < 31; i++) {
        if (N & (1 << i)) {
            start = i;
            break;
        }
    }
    for (i = start; i < 31; i++) {
        if (N & (1 << i)) {
            if (count > gap) {
                gap = count;
            }
            count = 0;
        } else {
            count++;
        }
    }
    return gap;
};
console.log(solution(1041));