Back to Topics
Bit Manipulation
10 questions in this topic
| # | Status | Problem | Difficulty | Marks | Save | Notes | Revision |
|---|---|---|---|---|---|---|---|
| 1 |
Count set bits in an integer
|
Medium | 0 | ||||
| 2 |
Find the two non-repeating elements in an array of repeating elements
|
Medium | 0 | ||||
| 3 |
Count number of bits to be flipped to convert A to B
|
Medium | 0 | ||||
| 4 |
Count total set bits in all numbers from 1 to n
|
Medium | 0 | ||||
| 5 |
Program to find whether a no is power of two
|
Medium | 0 | ||||
| 6 |
Find position of the only set bit
|
Medium | 0 | ||||
| 7 |
Copy set bits in a range
|
Medium | 0 | ||||
| 8 |
Divide two integers without using multiplication, division and mod operator
|
Medium | 0 | ||||
| 9 |
Calculate square of a number without using *, / and pow()
|
Medium | 0 | ||||
| 10 |
Power Set
|
Medium | 0 |