# Count set bits using Python List comprehension

Write an efficient program to count number of 1s in binary representation of an integer.

Examples:

Input : n = 6 Output : 2 Binary representation of 6 is 110 and has 2 set bits Input : n = 11 Output : 3 Binary representation of 11 is 1101 and has 3 set bits

We have existing solution for this problem please refer Count set bits in an integer link. We will solve this problem in Python using List comprehension. Approach is simple,

- Convert given number into it’s binary representation using bin(number) function.
- Now separate out all 1’s from binary representation of given number and print length of list of 1’s.

`# Function to count set bits in an integer ` `# in Python ` ` ` `def` `countSetBits(num): ` ` ` ` ` `# convert given number into binary ` ` ` `# output will be like bin(11)=0b1101 ` ` ` `binary ` `=` `bin` `(num) ` ` ` ` ` `# now separate out all 1's from binary string ` ` ` `# we need to skip starting two characters ` ` ` `# of binary string i.e; 0b ` ` ` `setBits ` `=` `[ones ` `for` `ones ` `in` `binary[` `2` `:] ` `if` `ones` `=` `=` `'1'` `] ` ` ` ` ` `print` `len` `(setBits) ` ` ` `# Driver program ` `if` `__name__ ` `=` `=` `"__main__"` `: ` ` ` `num ` `=` `11` ` ` `countSetBits(num) ` |

*chevron_right*

*filter_none*

Output:

3

## Recommended Posts:

- Python List Comprehension | Segregate 0's and 1's in an array list
- Python | List comprehension vs * operator
- Python List Comprehension and Slicing
- Python List Comprehension to find pair with given sum from two arrays
- Python List Comprehension | Three way partitioning of an array around a given range
- K’th Non-repeating Character in Python using List Comprehension and OrderedDict
- Move all zeroes to end of array using List Comprehension in Python
- List comprehension and ord() in Python to remove all characters other than alphabets
- Python List Comprehension | Sort even-placed elements in increasing and odd-placed in decreasing order
- Python | Count set bits in a range
- Python Bin | Count total bits in a number
- Python | Count unset bits in a range
- Python map function | Count total set bits in all numbers from 1 to n
- Check if bits of a number has count of consecutive set bits in increasing order
- Python list function | count()

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.