More Problems

• Check if a number’s binary representation has more trailing 0s than 1s.
• Create a function that sets all bits in the left half of a binary number.
• Write a function to calculate the number of leading 1s in a binary number.
• Implement a function to create a mask with the least k bits cleared.
• Check if the binary representation of a number is a palindrome.
• Write a function to extract the last k bits of a number.
• Create a function to toggle the k-th and l-th bits of a number.
• Find the maximum XOR of two elements in an array.