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 count = 0;
    while (n) {
        count += n & 1;  // Increment count if the least significant bit is 1
        n >>= 1;         // Right shift n to check the next bit
    }
    return count;
}

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