Count Set Bits in an Integer

Solving Approach

How do you plan to solve it?

Code

#include <stdio.h>

int countSetBits(unsigned int n) {
    // Write your code here
    int res = 0;
    for(int i= 0; i < 32; i++)
    {
        res += (n& (1<<i)) > 0;
    }
    return res;
}

int main() {
    int n;
    scanf("%d", &n);
    printf("%d", countSetBits(n));
    return 0;
}