Bit-Manipulation

Master bitwise operations and binary manipulation techniques.

Find the missing number in an array containing n distinct numbers taken from 1, 2, 3, ..., n+1

Find the missing number in an array containing n distinct numbers taken from 0, 1, 2, ..., n.

Check if a given integer is a power of two.

Reverse the bits of a given 32-bit unsigned integer.

Find the single number that appears once in an array where every other number appears twice.

Given an integer array of unique elements, return all possible subsets (the power set)