Given a positive integer n, return the number of set bits (1s) in its binary representation. This value is also known as the Hamming weight or popcount.
Input: n = 11 Output: 3 Explanation: 11 in binary is 1011, which has three 1-bits.
Input: n = 128 Output: 1 Explanation: 128 in binary is 10000000, which has one 1-bit.
Input: n = 4294967293 Output: 31 Explanation: 4294967293 in binary is 11111111111111111111111111111101, which has 31 1-bits.
1 <= n <= 2^32 - 1n = 11