Count Set Bits in an Integer

Solving Approach

How do you plan to solve it?

Code

#include <stdio.h>

int countSetBits(unsigned int n) {
    int count = 0;
    while(n){
        count = count + (n & 0x01);
        n = n >> 1;
    }
    return count;
}

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