1

Introduction to Bit Manipulation [Theory]

2

Check if the i-th bit is set or not

3

Check if a number is odd or not

4

Check if a number is power of 2 or not

5

Count the number of set bits

6

Set/Unset the rightmost unset bit

7

Swap two numbers

8

Divide two integers without using multiplication, division and mod operator

1

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

2

Find the number that appears odd number of times

3

Power Set

4

Find xor of numbers from L to R

5

Find the two numbers appearing odd number of times

1

Print Prime Factors of a Number

2

All Divisors of a Number

3

Sieve of Eratosthenes

4

Find Prime Factorisation of a Number using Sieve

5

Power(n, x)