# Status Problem Level Completes Likes
1

Convert a Decimal number to its binary representation

Beginner % 1
2

Find the number of pairs with odd XOR

Beginner % 2
3

Hamming Distance between two given integers

Beginner % 1
4

Number's Complement - 2 Approaches

Medium % 1
5

Count Set bits in a given Number

Beginner % 1
6

Multiply with power of 2 without using pow() or * operator

Beginner % 1
7

Check if Given Number is power of 2.

Beginner % 1
8

Swap two numbers using Bitwise XOR Operator

Medium % 1
9

Divide with power of 2 without using pow() or / operator

Beginner % 1
10

Left Shift (<<) and Right Shift (>>) Operators

Beginner % 1
11

Convert Number to base 3 String Representation

Beginner % 1
12

Find two non-repeating numbers in an array in O(n) time and O(1) space

Hard % 1
13

Number of bit to be flipped to convert one number to another.

Beginner % 1
14

All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space

Hard % 1
15

Find the only element in array which appears only once

Beginner % 1
16

Number of 1’s in bit representation of a number

Beginner % 1
17

Find the right most unset bit OR zero bit of a number

Beginner % 1
18

Find the two repeating elements in a given array | 6 Approaches

Medium % 1
19

Find the right most set bit of a number

Beginner % 1
20

Find a Number occurring odd number of times in a Given array

Beginner % 1
21

Find a Missing Number From a Sequence of Consecutive Numbers | XOR Method

Beginner % 1
22

Generate All Strings of n bits.

Medium % 1
23

Find The Missing Duplicate in a Given Array.

Beginner % 1
24

Reverse the binary representation of a number.

Medium % 1

Convert a Decimal number to its binary representation

Find the number of pairs with odd XOR

Hamming Distance between two given integers

Number's Complement - 2 Approaches

Count Set bits in a given Number

Multiply with power of 2 without using pow() or * operator

Check if Given Number is power of 2.

Swap two numbers using Bitwise XOR Operator

Divide with power of 2 without using pow() or / operator

Left Shift (<<) and Right Shift (>>) Operators

Convert Number to base 3 String Representation

Find two non-repeating numbers in an array in O(n) time and O(1) space

Number of bit to be flipped to convert one number to another.

All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space

Find the only element in array which appears only once

Number of 1’s in bit representation of a number

Find the right most unset bit OR zero bit of a number

Find the two repeating elements in a given array | 6 Approaches

Find the right most set bit of a number

Find a Number occurring odd number of times in a Given array

Find a Missing Number From a Sequence of Consecutive Numbers | XOR Method

Generate All Strings of n bits.

Find The Missing Duplicate in a Given Array.

Reverse the binary representation of a number.