Number of 1 Bits

Try to solve the Number of 1 Bits problem.


Write a function that takes a 32-bit binary representation of an integer nn and returns the count of its 11 bits.

The binary representation of an integer is a sequence of 00s and 11s that represents the integer's value using base-2 notation. An example of the 32-bit binary representation of integer 1313 is 0000000000000000000000000000110100000000000000000000000000001101.


  • The input must be a 32-bit binary representation of the integer.

Note: In languages like Python, there is an option to use unsigned integerThe unsigned integers can only be positive or zero, and they don't have a sign bit. type as the input type, so the input type is an unsigned interger. However, in Java, there is no built-in unsigned integer type, so the input type is a signed integer. In this lesson, we have displayed it as a string of binary numbers solely for visualization purposes.


Level up your interview prep. Join Educative to access 70+ hands-on prep courses.