Number of 1 Bits Hamming Problem

Number of 1 Bits Hamming Problem — ExecCode School DSA Practice

Solve the Number of 1 Bits Hamming problem on ExecCode. Free online school DSA practice in Arrays - Basics. Write and run code in Java, C++, Python — no signup required to run.

Problem description

You are given a whole number. Your task is to solve Number of 1 Bits Hamming. Count how many 1 bits are in its binary form and print that count.

Examples

Input 11; Output 3. Input 128; Output 1

Constraints

1<=n<=10^5

Practice Number of 1 Bits Hamming free on ExecCode. Browse DSA problems, topic map, and placement guides.