EXAMS - Binary Gap

binary_gap_2.js

function solution(N) {
    // write your code in JavaScript (Node.js 6.4.0)
    var str = (N >>> 0).toString(2).split('');
    var items = [];
    var flag = false;

    for (var i=0; i<str.length; i++) {      
        if (str[i] !== "0") {
            flag = false;
        } else if (str[i] === "0" && flag === false) {
            items[items.length] = "0";
            flag = true;    
        } else if (str[i] === "0" && flag === true) {
            items[items.length - 1] = items[items.length - 1] + "0";   
        }
    }
    
    if (items.length === 0) {
        return 0;    
    }
    
    return items.sort((a, b) => b.length - a.length)[0].length;
}