- Use the XOR operator (^) to find the bit difference between the two numbers.
- Convert to a binary string using Number.prototype.toString(2).
- Count and return the number of 1s in the string, using String.prototype.match(/1/g).
//#Source https://bit.ly/2neWfJ2 const hammingDistance = (num1, num2) => ((num1 ^ num2).toString(2).match(/1/g) || '').length; console.log(hammingDistance(2, 3)); console.log(hammingDistance(5, 3));
Improve this sample solution and post your code through Disqus
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
- Weekly Trends
- Python Interview Questions and Answers: Comprehensive Guide
- Scala Exercises, Practice, Solution
- Kotlin Exercises practice with solution
- MongoDB Exercises, Practice, Solution
- SQL Exercises, Practice, Solution - JOINS
- Java Basic Programming Exercises
- SQL Subqueries
- Adventureworks Database Exercises
- C# Sharp Basic Exercises
- SQL COUNT() with distinct
- Java Collection Exercises
- SQL COUNT() function
- SQL Inner Join