First clear solution for The Hamming Distance by bartorbard - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

First solution in Clear category for The Hamming Distance by bartorbard

def checkio(n, m):
    num = n
    num2 = m

    numBin=(str(bin(num))[2:])
    numBin2=(str(bin(num2))[2:])
    tmp = 0

    if len(numBin) < len(numBin2):
        tmp = numBin
        numBin = numBin2
        numBin2 = tmp
  
    while (len(numBin) > len(numBin2)):
        numBin2 = ("0"+numBin2)

    n=0
    numbCount=0

    for eachChar in numBin:
        if (numBin[n:n+1] != numBin2[n:n+1]):
            numbCount=numbCount+1
  
        n=n+1
  
    return (numbCount)

    
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"

Nov. 27, 2016

GitHub

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.