ProDeveloperTutorial.com

Problem Statement: You are given an int value “n”, calculate the XOR from 1 to n. Example: Input : n = 6 Output : 7 1 ^ 2 ^ 3 ^ 4…

Problem Statement: You are given a number, toggle all even bit of the number. Example: Input: 10 Output: 0 10 in binary 1010 After toggle 0000…

Problem Statement: You are given 2 integers, you need to perform bitwise recursive addition of 2 integers. Example: x = 10 y = 15 Output: 25…

Problem Statement: You are given a number n, you need to check if its binary representation is a palindrome or not. Example: Input : 9 Output:…

Problem Statement: You are given a number, reverse all the bits of the number. Example: Input : n = 1 Output : 2147483648 Solution 1: Loop…

Problem Statement: You need to add 1 to given number using bitwise operations. Example: Input: 10 Output: 11 Solution 1 To add 1 to any…

Problem Statement: You are given a number “N”. You need to print all the numbers with no consecutive 1s in binary representation…

1. Multiply a number with 2 ^n 2. Check if a number is power of 4 or not 1. Multiply a number with 2 ^n The solution is very simple. We know…

1. Swap 2 nibble 2. Swap all even and odd bits 3. Swapping pair of bits in a Byte 1. Swap 2 nibble (num & 0x0F)<<4 | (num &…