Skip to content

191. Number of 1 Bits

Easy

Description

Given a positive integer n, write a function that returns the number of set bits (1) in its binary representation (also known as the Hamming weight).

  1. ๐Ÿ™‹โ€โ™‚๏ธ A set bit refers to a bit in the binary representation of a number that has a value of 1

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 bit.

Example 3:

Input: n = 2147483645

Output: 30

Explanation:

The input binary string 1111111111111111111111111111101 has a total of thirty set bits.

Constraints:

  • 1 <= n <= 231 - 1

Solutions

Akhil Singh Chauhan Akhil Singh Chauhan
Creator

Comments