Files
30-seconds-of-code/snippets/hamming-distance.md
2017-12-14 00:05:44 +02:00

351 B

Hamming distance

Use XOR operator (^) to find the bit difference between the two numbers, convert to binary string using toString(2). Count and return the number of 1s in the string, using match(/1/g).

const hammingDistance = (num1, num2) =>
  ((num1 ^ num2).toString(2).match(/1/g) || '').length;
// hammingDistance(2,3) -> 1