More Problems

• Find the number of set bits in a number’s binary representation without using built-in functions.
• Write a function that shifts a number right by k bits.
• Write a function that shifts a number left by k bits.
• Set the ith bit and clear the (i-1)th bit in a given number.
• Implement a function that counts the number of 1 bits between the ith and jth positions in a binary number.
• Write a function to unset the last k bits of a number.
• Create a function to toggle the last k bits of a number.
• Implement a function to create a binary mask where only the ith bit is set.