Explaining Leetcode
In this video I explain the algorithm behind solving Leetcode problem #477 Hamming Distance. I start with looping the approach that I used to solve #461 Hamming Distance ( • Explaining Leetcode #461 Hamming Dist... ), then I move to a more efficient approach.
I am coding in Java since its syntax is easy to understand by all programmers. The algorithms can be applied easily in other languages and most functions that I use have a counterpart in your language of choice.
00:00 I start by explaining the problem and relating it to the previous problem.
03:22 I use loop through the elements using XOR and counting set bits. This is a clear method yet it results in exceeding the time limit.
10:03 I move to a more efficient way based on bit position.
Related Topics: Bit Manipulation