## LeetCode 191 Number of 1 Bits in Java

In this post we will solve the LeetCode 191 Number of 1 Bits problem using the Java programming language.

```Write a function that takes an unsigned integer and returns the number of '1' bits it has (also known as the Hamming weight).

Note:

Note that in some languages, such as Java, there is no unsigned integer type.
In this case, the input will be given as a signed integer type.
It should not affect your implementation, as the integer's internal binary representation is the same,
whether it is signed or unsigned.
In Java, the compiler represents the signed integers using 2's complement notation.
Therefore, in Example 3, the input represents the signed integer. -3.

Constraints:

o The input must be a binary string of length 32.
```

The requirements call to develop a function that takes as an argument an unsigned integer and returns the number of bits set to 1. Note that the integers have 32-bits. Continue reading “LeetCode 191 Number of 1 Bits in Java”