count_of_set_bits || C++. Can be solved using a single library to find the number of set bits in a number.

[deoliaman00]

Detailed description

The current solution of the Problem counting no of set bits in a number is done with the traditional way that consumes more time complexity then the inbuilt library in C++ for counting the no of bits. So can I add that code too in the present code and improve it.

Context

The function has O(k) time complexity which is way less then O(logn) since the k is no of set bits and n here is the number itself.

Possible implementation

No response

Additional information

No response

[deoliaman00]

I want to work on this issue immediately Kindly assign me this issue so that I can work on it asap. Thanks.

[mishraabhinn]

@deoliaman00 assigned. Please read the contribution guidelines before even starting to code. You can anytime raise pr and it will be reviewed. You can ping me or join the discord to get answers to any of your doubts. Thanks and happy coding.

[deoliaman00]

Please See my pull request as I have already done the work.

[thewpingmonk]

please assign this issue to me

[prabhatsingh985]

I would love to work in this project ; Please assign this to me

[nitink3006]

hello sir, would you please assign this issue to me..???

[github-actions[bot]]

This issue has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions[bot]]

Please ping one of the maintainers once you add more information and updates here. If this is not the case and you need some help, feel free to ask for help in our Gitter channel or our Discord server. Thank you for your contributions!