Bit Manipulation Problems

1

Count set bits in an integer

2

Find the two non-repeating elements in an array of repeating elements

3

Program to find whether a no is power of two

4

Find position of the only set bit

5

Count number of bits to be flipped to convert A to B

6

Count total set bits in all numbers from 1 to n

7

Copy set bits in a range

8

Calculate square of a number without using *, / and pow()

9

Divide two integers without using multiplication, division and mod operator

10

Power Set