Tasks Details
easy
1.
BinaryGap
Find longest sequence of zeros in binary representation of an integer.
Task Score
100%
Correctness
100%
Performance
Not assessed
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. The number 32 has binary representation 100000 and has no binary gaps.
Write a function:
def solution(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. Given N = 32 the function should return 0, because N has binary representation '100000' and thus no binary gaps.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..2,147,483,647].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Python
Time spent on task 12 minutes
Notes
not defined yet
Task timeline
Code: 13:42:33 UTC,
java,
autosave
Code: 13:42:44 UTC,
java,
autosave
Code: 13:44:19 UTC,
py,
verify,
result: Failed
Analysis
expand all
Example tests
example1
example test n=1041=10000010001_2
example test n=1041=10000010001_2
✘
RUNTIME ERROR
tested program terminated with exit code 1
tested program terminated with exit code 1
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 123, in <module>
main()
File "exec.py", line 85, in main
result = solution( N )
File "/tmp/solution.py", line 7, in solution
decToBinary = bin(n).replace("0b", "")
NameError: name 'n' is not defined
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 123, in <module>
main()
File "exec.py", line 85, in main
result = solution( N )
File "/tmp/solution.py", line 7, in solution
decToBinary = bin(n).replace("0b", "")
NameError: name 'n' is not defined
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 123, in <module>
main()
File "exec.py", line 85, in main
result = solution( N )
File "/tmp/solution.py", line 7, in solution
decToBinary = bin(n).replace("0b", "")
NameError: name 'n' is not defined
Code: 13:44:30 UTC,
py,
verify,
result: Failed
Analysis
expand all
Example tests
example1
example test n=1041=10000010001_2
example test n=1041=10000010001_2
✘
RUNTIME ERROR
tested program terminated with exit code 1
tested program terminated with exit code 1
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
10000010001
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
1111
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
100000
Code: 13:44:47 UTC,
py,
autosave
Code: 13:45:10 UTC,
py,
autosave
Code: 13:45:31 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
"""
Loops string with binary eq of N
if it finds 1
"""
print(decToBinary)
Code: 13:45:43 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
"""
Loops string with binary eq of N
if it finds 1
Start counting 0
"""
print(decToBinary)
Code: 13:45:57 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
"""
Loops string with binary eq of N
if it finds 1
Start counting gap
"""
print(decToBinary)
Code: 13:46:27 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
Start counting gap
"""
print(decToBinary)
Code: 13:46:42 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
Start counting gap
"""
print(decToBinary)
Code: 13:47:16 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
Start counting gap
"""
print(decToBinary)
Code: 13:47:27 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
Start counting gap
"""
print(decToBinary)
Code: 13:48:17 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
Start counting gap
"""
print(decToBinary)
Code: 13:48:27 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
Start counting gap
"""
print(decToBinary)
Code: 13:48:42 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
Start counting gap
"""
print(decToBinary)
Code: 13:48:53 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
print(decToBinary)
Code: 13:49:12 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
for i in S:
if
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
print(decToBinary)
Code: 13:49:24 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
for i in S:
if i == '1':
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
print(decToBinary)
Code: 13:49:41 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
answer = 0
counter = 0
for i in S:
if i == '1':
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
print(decToBinary)
Code: 13:49:54 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
answer = 0
counter = 0
for i in S:
if i == '1':
if answer < cunter:
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
print(decToBinary)
Code: 13:50:07 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
answer = 0
counter = 0
for i in S:
if i == '1':
if answer < cunter:
answer = counter
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
print(decToBinary)
Code: 13:50:24 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
answer = 0
counter = 0
for i in S:
if i == '1':
if answer < counter:
answer = counter
counter = 0
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
print(decToBinary)
Code: 13:50:46 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
answer = 0
counter = 0
for i in S:
if i == '1':
if answer < counter:
answer = counter
counter = 0
else:
counter += 1
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
print(decToBinary)
Code: 13:50:58 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
answer = 0
counter = 0
for i in S:
if i == '1':
if answer < counter:
answer = counter
counter = 0
else:
counter += 1
return
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
print(decToBinary)
Code: 13:51:09 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
answer = 0
counter = 0
for i in S:
if i == '1':
if answer < counter:
answer = counter
counter = 0
else:
counter += 1
return answer
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
print(decToBinary)
Code: 13:51:11 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
answer = 0
counter = 0
for i in S:
if i == '1':
if answer < counter:
answer = counter
counter = 0
else:
counter += 1
return answer
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
print(decToBinary)
Analysis
expand all
Example tests
example1
example test n=1041=10000010001_2
example test n=1041=10000010001_2
✘
RUNTIME ERROR
tested program terminated with exit code 1
tested program terminated with exit code 1
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 123, in <module>
main()
File "exec.py", line 85, in main
result = solution( N )
File "/tmp/solution.py", line 10, in solution
for i in S:
NameError: name 'S' is not defined
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 123, in <module>
main()
File "exec.py", line 85, in main
result = solution( N )
File "/tmp/solution.py", line 10, in solution
for i in S:
NameError: name 'S' is not defined
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 123, in <module>
main()
File "exec.py", line 85, in main
result = solution( N )
File "/tmp/solution.py", line 10, in solution
for i in S:
NameError: name 'S' is not defined
Code: 13:51:31 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
answer = 0
counter = 0
for i in decToBinary:
if i == '1':
if answer < counter:
answer = counter
counter = 0
else:
counter += 1
return answer
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
print(decToBinary)
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 1 expected 5
1.
0.036 s
WRONG ANSWER,
got 1 expected 0
1.
0.036 s
OK
Code: 13:52:32 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
answer = 0
counter = 0
for i in decToBinary:
if i == '1':
if answer < counter:
answer = counter
counter = 0
else:
counter += 1
return answer
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
print(decToBinary)
Code: 13:52:42 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
answer = 0
counter = 0
gapExistence = False
for i in decToBinary:
if i == '1':
if answer < counter:
answer = counter
counter = 0
else:
counter += 1
return answer
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
print(decToBinary)
Code: 13:53:11 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
answer = 0
counter = 0
gapExistence = False
for i in decToBinary:
if i == '1':
if answer < counter:
answer = counter
counter = 0
else:
counter += 1
return answer
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
print(decToBinary)
Code: 13:53:21 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
answer = 0
counter = 0
gapExistence = False
for i in decToBinary:
if i == '1':
if answer < counter:
answer = counter
counter = 0
else:
counter += 1
return answer
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
print(decToBinary)
Code: 13:53:32 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
answer = 0
counter = 0
gapExistence = False
for i in decToBinary:
if i == '1':
if answer < counter:
answer = counter
counter = 0
else:
counter += 1
return answer
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
print(decToBinary)
Code: 13:53:35 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
answer = 0
counter = 0
gapExistence = False
for i in decToBinary:
if i == '1':
if answer < counter:
answer = counter
counter = 0
else:
counter += 1
return answer
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
print(decToBinary)
Analysis
Code: 13:53:52 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
answer = 0
counter = 0
gapExistence = False
for i in decToBinary:
if i == '1':
if answer < counter:
answer = counter
counter = 0
else:
counter += 1
return answer
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
Code: 13:53:54 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
answer = 0
counter = 0
gapExistence = False
for i in decToBinary:
if i == '1':
if answer < counter:
answer = counter
counter = 0
else:
counter += 1
return answer
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
Analysis
Code: 13:54:06 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
answer = 0
counter = 0
gapExistence = False
for i in decToBinary:
if i == '1':
if answer < counter:
answer = counter
counter = 0
else:
counter += 1
return answer
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
Analysis
Code: 13:54:08 UTC,
py,
final,
score:
100
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
#Converts N to a string with binary eq of int N
decToBinary = bin(N).replace("0b", "")
answer = 0
counter = 0
gapExistence = False
for i in decToBinary:
if i == '1':
if answer < counter:
answer = counter
counter = 0
else:
counter += 1
return answer
"""
Loops string with binary eq of N
if it finds 1
check if current max < counter
update it if it is
reset counter
update counter
return counter
"""
Analysis summary
The solution obtained perfect score.
Analysis
expand all
Correctness tests
1.
0.036 s
OK
2.
0.036 s
OK
3.
0.036 s
OK
1.
0.040 s
OK
2.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
3.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
1.
0.036 s
OK
1.
0.036 s
OK
1.
0.036 s
OK
1.
0.036 s
OK
1.
0.036 s
OK
1.
0.036 s
OK
1.
0.036 s
OK