Number of 1 Bits — Easy Coding Interview Question

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

Example

Input: n = 11

Output: 3

Explanation: 11 in binary is 1011 (3 set bits)

Constraints

• 1 <= n <= 2^31 - 1

Topics & Companies

Topics: bit-manipulation

Asked by: Apple, Microsoft

Optimal Solution Complexity

Time complexity: O(set bits). Space complexity: O(1).

Practice more

• All DSA Problems
• DSA Patterns