BinaryGap Codility solution, A binary gap within a positive integer N is any maximal sequence of consecutive zeros that is surrounded by ones at both ends in the binary representation of N

BinaryGap solution

function solution(N) {
    const binary = N.toString(2);
    let gaps = [];
    let count = 0;
    for(let b of binary) {
        if(b === "0") {
            count++
        } else {
            gaps.push(count);
            count = 0
        }
    }
    return Math.max(...gaps);
}

BinaryGap solution with REGEX

function solution(N) {
    const binary = N.toString(2);
    let gaps = binary.match(/(?!1)(0+)(?=1)/g);
    if(!gaps) {
      return 0;
    }
    gaps = gaps.map(e => e.length);
    return Math.max(...gaps);
}