PIXELBANKv7.6.0

•

•

•About•Pricing

Sign In Sign Up

PIXELBANKv7.6.0

Menu

Loading...

📘

Number of 1 Bits

EasyBit Manipulation

Given a positive integer, return the number of set bits (1s) in its binary representation (also known as Hamming weight).

Example:

Input:

Output:

Reasoning:

First, we convert the input number 11 to its binary representation: $11_{10} = 1011_2$
Then, we count the number of set bits (1s) in the binary representation: $1011_2$ has 3 set bits
The final output is the count of set bits, which is $3$

Constraints:

0 <= n <= 2^31 - 1

Editor

Python 3.13.1

Test Results

0/0

Run code to see test results.