Codility - Binary Gap

binary-gap.py

def solution(N):
    if N < 0: return 0

    binary_string = bin(N)[2:]

    max_gap_count = current_gap_count = 0
    for index in range(len(binary_string)):
        if binary_string[index] == "0":
            current_gap_count += 1
        else:
            max_gap_count = max(current_gap_count, max_gap_count)
            current_gap_count = 0

    return max_gap_count

solution-2.py

import re

def solution(N):
  if N < 0: return 0

  return len(max(re.sub(r'0+$', "", bin(N)[2:]).split('1')))

solution-3.py

def solution(N):
    N_string = bin(N)[2:]

    current_zeros_count = 0
    max_zeros_found = 0
    
    for digit in N_string:        
        if digit == "1":
            max_zeros_found = max(max_zeros_found, current_zeros_count)
            current_zeros_count = 0
            continue

        current_zeros_count += 1

    return max_zeros_found