More Problems

• Turn off the rightmost set bit of a number.
• Find the two non-repeating elements in an array where every other element repeats twice.
• Determine if a number can be expressed as the sum of two powers of two.
• Check if a number has alternating bits (like 010101).
• Generate a mask with the lowest k bits set to 1.
• Implement a function to turn off all bits except the lowest set bit.
• Rotate bits of a number to the left by k positions.
• Rotate bits of a number to the right by k positions.