Added Count Total Set Bits from 1 to N (Bit Manipulation)#6997
Closed
Shewale41 wants to merge 7 commits intoTheAlgorithms:masterfrom
Closed
Added Count Total Set Bits from 1 to N (Bit Manipulation)#6997Shewale41 wants to merge 7 commits intoTheAlgorithms:masterfrom
Shewale41 wants to merge 7 commits intoTheAlgorithms:masterfrom
Conversation
Contributor
Author
|
Hey @DenizAltunkapan @yanglbme @alxkm 👋 can you please review this PR , I have cleared all the checks can you merge my PR. |
Member
|
@Shewale41 CountSetBits already exists in https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/bitmanipulation/CountSetBits.java Please make sure to check our directory.md before opening a PR |
This file contains hidden or 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
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.
Description
This PR adds an implementation for counting the total number of set bits
from 1 to N using bit manipulation.
The algorithm efficiently counts bits using mathematical observation and avoids
iterating through all numbers, running in O(log N) time.
Type of change
Checklist