updated code #2922
Open
updated code #2922
+10
−9
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
ehtashammd07
requested review from
Panquesito7 and
realstealthninja
as code owners
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Bit manipulation : Count number of bits to be flipped to convert A to B
Fixes #2921
Approach
Use XOR (^) to Identify Differing Bits
The XOR operation returns 1 when bits are different and 0 when they are the same.
xor_value = start ^ goal gives a number where 1s represent the bits that need to be flipped.
Count the Number of 1s in xor_value
We count the number of 1s in the binary representation of xor_value.
This is done using xor_value & 1 (to check the last bit) and xor_value >>= 1 (to shift right and check the next bit).