# Largest Binary Gap — Codility

As part of Demo Test — Codility practices

#Python Largest Binary Gap

Codility is one coding assessment platform (aside from HackerRank) that is being used by companies.

Rakuten Viki is one company that uses this for software engineer or related positions

**Question:**

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.

For example, number 9 has binary representation 1001 and contains a binary gap of length 2. The number 529 has binary representation 1000010001 and contains two binary gaps: one of length 4 and one of length 3. The number 20 has binary representation 10100 and contains one binary gap of length 1. The number 15 has binary representation 1111 and has no binary gaps.

Write a function:

*int solution(int N);*

that, given a positive integer N, returns the length of its longest binary gap. The function should return 0 if N doesn’t contain a binary gap.

For example, given N = 1041 the function should return 5, because N has binary representation 10000010001 and so its longest binary gap is of length 5.

Assume that:

- N is an integer within the range [1..2,147,483,647].

Complexity:

- expected worst-case time complexity is O(log(N));
- expected worst-case space complexity is O(1).

# Solution:

Use the python **bin()** function to convert decimal to binary

eg. print(bin(10)) gives string value of “0b1010” — you have to remove the “0b” at the front.

**def** **solution**(N):

binStr = str(bin(N))[2:] # O(1)

zeroCounter= **False **

maxZeroCount = 0

zeroCounter = 0

**for** char **in** binStr: # O(N)

**if** char == '1':

**if** maxZeroCount < zeroCounter:

maxZeroCount = zeroCounter

zeroCounter = **True**

zeroCounter= 0

**elif** zeroCounter:

zeroCounter += 1

**return** maxZeroCount

# Alternative Solution

**def** **solution**(N):

**return** len(max(bin(N)[2:]**.**strip('0')**.**strip('1')**.**split('1')))

Faster and smarter soluton!

# Time Complexity

The most important analysis of the solution is definitely the time complexity. For this solution, it is **O(n)** as indicated in comments.

This is considered as an **Easy level** question.