Dashboard
#71. Number of 1 BitsEasyBit Manipulation

Given a positive integer n, write a function that returns the number of set bits it has (also known as the Hamming weight).

Examples
Example 1:
Input: n = 11
Output: 3
Explanation: The input binary string 1011 has a total of three set bits.
Example 2:
Input: n = 128
Output: 1
Explanation: The input binary string 10000000 has a total of one set bits.
Example 3:
Input: n = 2147483645
Output: 30
Explanation: The input binary string 1111111111111111111111111111101 has a total of thirty set bits.
Constraints
  • 1 <= n <= 2^31 - 1
Prerequisites
Target: O(1) time • O(1) spaceBitwise Manipulation (n & (n - 1))
Socratic AI Tutor
Gemini 3.8 Flash
Loading editor...

Click "Run" or press Ctrl+Enter to execute test cases.