Dataford
Interview QuestionsInterview GuidesExperiencesMock InterviewsPricing
Get started

Count Set Bits

EasyPython00:00
Practice interviewer
In session
5 left
00:00

Your question is Count Set Bits. Start with the requirements on the right.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.

Problem

Cyient embedded firmware often inspects status registers and diagnostic flags represented as unsigned integers. Given a non-negative 32-bit integer n, return the number of set bits, also called 1 bits, in its binary representation.

Use an efficient bit-manipulation approach. The function should count only the bits present in the supplied value and must not convert the integer to a string.

Formal Specification

Implement count_set_bits(n), where:

  • Input: n, a non-negative integer in the range 0 through 2^32 - 1.
  • Output: An integer representing the number of set bits in n.

Constraints

  • 0 <= n <= 2^32 - 1
  • The input is a non-negative integer
  • Do not convert the integer to a string

Function Signature

def count_set_bits(n):
Your solutionPython 3
You need to log in / sign up to run or submit.
Run your code to see test output