Question 1

How do you check if a number is a power of two using bit manipulation?

Accepted Answer

A number is a power of two if it has only one bit set to 1. You can check this by using the bitwise AND operator. If n > 0 and (n & (n - 1)) == 0, then n is a power of two.

Question 2

How do you count the number of set bits in an integer?

Accepted Answer

You can count the number of set bits by repeatedly turning off the rightmost set bit. This can be done by using the expression n & (n - 1). The number of times you can perform this operation before n becomes 0 is the number of set bits.

Bit Manipulation Interview Questions

Related Algorithm Guides