# Status Problem video Level Completes Likes 554 Counting bits - Leetcode Beginner % 0 531 Convert a Decimal number to its binary representation Beginner % 1 525 Find the number of pairs with odd XOR Beginner % 2 435 Hamming Distance between two given integers Beginner % 1 420 Number's Complement - 2 Approaches Medium % 1 357 Count Set bits in a given Number Beginner % 1 339 Multiply with power of 2 without using pow() or * operator Beginner % 1 330 Check if Given Number is power of 2 Beginner % 1 307 Swap two numbers using Bitwise XOR Operator Medium % 1 301 Bitwise Trick: Divide by Powers of 2 Without Operators Beginner % 1 298 Left Shift (<<) and Right Shift (>>) Operators Beginner % 1 293 Convert Number to base 3 String Representation Beginner % 1 243 Find two non-repeating numbers in an array in O(n) time and O(1) space Hard % 1 242 Find the Bit Flips Needed: Convert One Binary Number to Another Beginner % 1 240 All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space Hard % 1 228 Find the only element in array which appears only once Beginner % 1 224 Number of 1’s in bit representation of a number Beginner % 1 220 Find the right most unset bit OR zero bit of a number Beginner % 1 219 Find the two repeating elements in a given array | 6 Approaches Medium % 1 218 Find the right most set bit of a number Beginner % 1 141 Find the Single Occurrence Element in an Array (Odd One Out) Beginner % 1 139 Find Missing Numbers in Sequences - XOR Method Beginner % 1 112 Generate All n-Bit Binary Strings Medium % 1 111 Find Unique Number in Array with Duplicates (Except One) Beginner % 1 33 Reverse the binary representation of a number. Medium % 1 Counting bits - Leetcode 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 Bitwise Trick: Divide by Powers of 2 Without Operators 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 Find the Bit Flips Needed: Convert One Binary 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 the Single Occurrence Element in an Array (Odd One Out) Find Missing Numbers in Sequences - XOR Method Generate All n-Bit Binary Strings Find Unique Number in Array with Duplicates (Except One) Reverse the binary representation of a number. 1
