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,i=0,bit;
    int arr[32];
    while(n > 0)
    {
     bit = n % 2;
     arr[i] = bit;
     i++;
     n /= 2;
    }
   

    for(i=0;i<32;i++)
    {
        if(arr[i] == 1)
        {
            count++;
        }
    }
    return count;

}

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