# Bitwise Algorithms | Intermediate

- Swap bits in a given number
- Little and Big Endian Mystery
- Smallest of three integers without comparison operators
- A Boolean Array Puzzle
- Compute the integer absolute value (abs) without branching
- Compute the minimum or maximum of two integers without branching
- Find the two non-repeating elements in an array of repeating elements
- Write an Efficient C Program to Reverse Bits of a Number
- Smallest power of 2 greater than or equal to n
- Write a C program to find the parity of an unsigned integer
- Swap all odd and even bits
- Check if binary representation of a number is palindrome
- Generate n-bit Gray Codes
- Check if a given number is sparse or not
- Euclid’s Algorithm when % and / operations are costly
- Find nth Magic Number
- How to swap two bits in a given integer?
- Calculate square of a number without using *, / and pow()
- Generate 0 and 1 with 25% and 75% probability
- Find even occurring elements in an array of limited range
- Cyclic Redundancy Check and Modulo-2 Division
- Copy set bits in a range
- Check if a number is Bleak
- Count strings with consecutive 1’s
- Gray to Binary and Binary to Gray conversion
- Find Next Sparse Number
- Sum of bit differences among all pairs
- Sum of Bitwise And of all pairs in a given array
- Bitwise and (or &) of a range
- Length of the Longest Consecutive 1s in Binary Representation
- Pairs of complete strings in two sets of strings
- Find profession in a special family
- Print first n numbers with exactly two set bits
- Check if bits of a number has count of consecutive set bits in increasing order
- Subset sum queries using bitset
- Maximum 0’s between two immediate 1’s in binary representation
- Count all pairs of an array which differ in K bits
- Efficiently check if a string has duplicates without using any additional data structure
- Count trailing zero bits using lookup table
- Count smaller numbers whose XOR with n produces greater value
- Check divisibility in a binary stream
- Multiplication of two numbers with shift operator
- Determine if a string has all Unique Characters
- Reverse an array without using subtract sign ‘-‘ anywhere in the code
- Count numbers whose sum with x is equal to XOR with x
- Maximum XOR value of a pair from a range
- Numbers whose bitwise OR and sum with N are equal
- Change bits to make specific OR value
- Count smaller values whose XOR with x is greater than x
- Next greater integer having one more number of set bits
- Check if two numbers are bit rotations of each other or not
- Previous smaller integer having one less number of set bits
- Maximize a given unsigned number number by swapping bits at it’s extreme positions
- Set bits in N equals to M in the given range
- Count number of distinct sum subsets within given range
- Baum Sweet Sequence
- Minimum digits to remove to make a number Perfect Square
- Number whose sum of XOR with given array range is maximum
- Odd numbers in N-th row of Pascal’s Triangle
- Check if bitwise AND of any subset is power of two
- Space optimization using bit manipulations
- Fast inverse square root
- Find one extra character in a string
- Number of unique triplets whose XOR is zero
- Fibbinary Numbers (No consecutive 1s in binary)
- Fibbinary Numbers (No consecutive 1s in binary) – O(1) Approach
- Divide two integers without using multiplication, division and mod operator
- Check if binary string multiple of 3 using DFA
- Count set bits in an integer using Lookup Table
- Alternate bits of two numbers to create a new number
- Decimal representation of given binary string is divisible by 20 or not
- Check if actual binary representation of a number is palindrome
- Reverse actual bits of the given number
- Odious number
- Pernicious number
- Increment a number by one by manipulating the bits
- Python Slicing | Extract ‘k’ bits from a given position
- Print numbers in the range 1 to n having bits in alternate pattern
- Python | Count unset bits in a range
- Addition of two numbers without carry
- Josephus Problem Using Bit Magic
- XNOR of two numbers
- Maximum OR sum of sub-arrays of two different arrays
- Position of rightmost bit with first carry in sum of two binary
- Check whether the two numbers differ at one bit position only
- Queries on XOR of XORs of all subarrays
- Count unset bits in a range
- A backtracking approach to generate n bit Gray Codes
- Quotient and remainder dividing by 2^k (a power of 2)
- Print pair with maximum AND value in an array
- Smallest perfect power of 2 greater than n (without using arithmetic operators)
- Reverse bits using lookup table in O(1) time
- Variation in Nim Game
- Find largest element from array without using conditional operator
- Unset the last m bits
- Check if a number is divisible by 17 using bitwise operators
- Bitwise Sieve
- Largest number with binary representation is m 1’s and m-1 0’s
- Maximum AND value of a pair in an array
- Smallest number whose set bits are maximum in a given range
- Minimum flips to make all 1s in left and 0s in right | Set 1 (Using Bitmask)
- Find two numbers from their sum and XOR
- Print all subsequences of a string | Iterative Method
- Divisibility by 64 with removal of bits allowed
- Count set bits in a range
- Unique element in an array where all elements occur k times except one
- Find Unique pair in an array with pairs of numbers
- Check whether the number has only first and last bits set
- M-th smallest number having k number of set bits.
- Minimum bitwise operations to convert given a into b
- Minimum flips required to maximize a number with k set bits
- Count unset bits of a number
- Check whether all the bits are unset in the given range or not
- Toggle all bits after most significant bit
- Check if a number is power of 8 or not
- Position of rightmost common bit in two numbers
- Check whether all the bits are set in the given range
- Shuffle a pack of cards and answer the query
- Efficiently find first repeated character in a string without using any additional data structure in one traversal
- Change all even bits in a number to 0
- Computing INT_MAX and INT_MIN with Bitwise operations
- Add minimum number to an array so that the sum becomes even
- Get the position of rightmost unset bit
- Count pairs with Odd XOR
- Position of rightmost different bit
- Check if all bits of a number are set
- XOR of all subarray XORs | Set 2
- Case conversion (Lower to Upper and Vice Versa) of a string using BitWise operators in C/C++
- Highest power of 2 less than or equal to given number
- Find Two Missing Numbers | Set 2 (XOR based solution)
- Find the maximum subset XOR of a given set

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.