Solo practice workspace

Interview Coder drill

Number of 1 Bits

10:00

Easy

Given an integer, count the 1 bits in its unsigned 32-bit representation. Print the count.

Example 1

Input: n = 11

Output: 3

11 is 1011 in binary.

Constraints

0 <= n < 2^32Treat the input as unsigned 32-bit

Recall before you code

Capture your plan, then rate how clearly you recalled it before submitting.

What cues point to the Bit Manipulation pattern?What invariant or template will you maintain?Which edge cases could break your approach?

How well did you recall the approach?

solution.py

Runs: 0 | Submissions: 0

Loading Python runtime...