My code is absolutelt right but not working ...i dont knkw why..culd you please tell me

#1

question: set bits

https://practice.geeksforgeeks.org/problems/set-bits0143/1/?category[]=Bit%20Magic&problemStatus=unsolved&difficulty[]=-1&page=1&sortBy=submissions&query=category[]Bit%20MagicproblemStatusunsolveddifficulty[]-1page1sortBysubmissions

answer:
code is not copying properly, so i sent the main part of the code…could you please correct it

#2

hello @aarijrab

class Solution
{
public:
    int setBits(int N)
    {
        // Write Your Code here
        unsigned int count=0;
        for(int i=0;i<32;i++) {
            int temp=N&(1<<i);
            if(temp!=0) {
                count++;
            
            }
           
        }
        return count;
    }
};

this should be ur code.
a) there is no need to divide n .
b) else part is not required

#3

but what is wrong in my code…i did similar question…the logic is perfectly fine…could you please correct my code

#4

the code i shared above is ur corrected code only.

this is the logic -> go to each bit and check wheter it is set of not. if it is set then simply increment the count.

#5

for(int i=0;i<32;i++) { int temp=N&(1<<i);

#6

for(int i=0;i<32;i++) { … i&lt…bro please explain the syntax… int temp=N&(1<<i); bro what does these lines mean

#7

using this loop we are iterating to first 32 bit posiiton of given number.

N&(1<<i) this will give u zero if ith bit of given number is zero, otherwise it will return non zero number (2^i).

still if u r faccing any issue then i would suggest to watch bit manipulation plylist of ur course, everthing is covered there.

refer this article