Hamming distance between two binary strings of equal length is the number of mismatches between every corresponding positions of the two strings. Suppose A = “01001” and B = “11000” then the Hamming Distance between A and B is 2 because they only mismatch in position 1 and 5 (1- based indexing).

This is a companion discussion topic for the original entry at https://toph.co/p/hamming-distance