Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
xor, count solution in Clear category for The Hamming Distance by sudee
def checkio(n, m):
"""
The binary operator ^ (xor) produces ones at every position
where the corresponding bits are different
We get the binary representation using the bin function,
then count the ones representing the mismatching bits
"""
return bin(n ^ m).count('1')
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert checkio(117, 17) == 3, "First example"
assert checkio(1, 2) == 2, "Second example"
assert checkio(16, 15) == 5, "Third example"
Aug. 12, 2018