Codility.com BinaryGap 100%

binarygap.py

def solution(N):
    max = 0
    bits = 0
    bin = "{0:b}".format(N)
    
    for c in bin:
        if c == "0":
            bits += 1
        if c == "1":
            if max < bits:
                max = bits
            bits = 0
    return max

The solution in C:

int solution(int n) {
    int k = n;
    int max = 0;
    int bits = 0;
    int cursor = 0;
    int started = 0;
    
    while (k > 0) {
        cursor = k & 1;
        if (cursor == 0 && started == 1) { bits += 1; }
        if (cursor == 1) {
            started = 1;
            if (max < bits) { max = bits; }
            bits = 0;
        }
        k >>= 1;
    }
    
    return max;
}