Topic: bit-manipulation-problem / Level: beginner

• 1. Count the number of set bits in a given integer.
• 2. Check if a number is even or odd using bit manipulation.
• 3. Swap two numbers using the XOR operator.
• 4. Find the unique number in an array where all other numbers occur twice.
• 5. Reverse the bits of a given integer.
• 6. Check if a number is a power of two using bit manipulation.
• 7. Clear the rightmost set bit of a given integer.
• 8. Check if two numbers have opposite signs using bitwise operators.
• 9. Count the number of leading zeros in a given integer.
• 10. Set the ith bit of a number.
• 11. Clear the ith bit of a number.
• 12. Toggle the ith bit of a number.
• 13. Check if the ith bit of a number is set.
• 14. Find the position of the most significant set bit.
• 15. Multiply a number by 2 using bitwise operators.
• 16. Divide a number by 2 using bitwise operators.
• 17. Add two numbers without using arithmetic operators.
• 18. Find the XOR of all elements in an array.
• 19. Determine whether a number is a palindrome in its binary representation.
• 20. Find the position of the rightmost set bit in a number.
• 21. Turn off the rightmost set bit of a number.
• 22. Find the two non-repeating elements in an array where every other element repeats twice.
• 23. Determine if a number can be expressed as the sum of two powers of two.
• 24. Check if a number has alternating bits (like 010101).
• 25. Generate a mask with the lowest k bits set to 1.
• 26. Implement a function to turn off all bits except the lowest set bit.
• 27. Rotate bits of a number to the left by k positions.
• 28. Rotate bits of a number to the right by k positions.
• 29. Compute the bitwise AND of a range of numbers.
• 30. Find the highest power of two less than or equal to a given number.
• 31. Count the number of 0s in the binary representation of a number.
• 32. Toggle all bits in a given integer.
• 33. Check if a number is divisible by 4 using bit manipulation.
• 34. Find the smallest power of two greater than or equal to a given number.
• 35. Check if a number is a multiple of 3 using bitwise operators.
• 36. Create a function that sets all bits after the rightmost set bit in a number.
• 37. Implement a function that inverts all bits of a number.
• 38. Find the largest power of two divisor of a number.
• 39. Check if the binary representation of a number has a single set bit.
• 40. Multiply two numbers using bit manipulation.
• 41. Determine if a number can be represented as a sum of distinct powers of two.
• 42. Create a function that returns the number with all bits set after the most significant set bit.
• 43. Find the smallest bit that needs to be flipped to convert one number to another.
• 44. Compute the bitwise OR of all elements in an array.
• 45. Check if the binary representation of a number has an equal number of 0s and 1s.
• 46. Find the most significant bit position of a number using bitwise operators.
• 47. Create a function to convert a number to its Gray code representation.
• 48. Create a function to convert a Gray code number back to its binary representation.
• 49. Implement a function that returns true if a number has an even number of set bits.
• 50. Find the next power of two greater than a given number.

• More Levels

• Intermediate
• Advanced