Swap bits in a given number Last Updated : 23 Jul, 2025 Comments Improve Suggest changes Like Article Like Report Try it on GfG Practice Given a number x and two positions (0 based from the right side) in the binary representation of x, write a function that swaps n bits at the given two positions and returns the result. It is also given that the two sets of bits do not overlap.Examples:Input:x = 47 (00101111)p1 = 1 (Start from the second bit from the right side)p2 = 5 (Start from the 6th bit from the right side)n = 3 (No of bits to be swapped)Output:227 (11100011)Explanation:The 3 bits starting from the second bit (from the right side) are swapped with 3 bits starting from 6th position (from the right side)Input:x = 28 (11100)p1 = 0 (Start from first bit from right side)p2 = 3 (Start from 4th bit from right side)n = 2 (No of bits to be swapped)Output:7 (00111)Explanation:The 2 bits starting from 0th position (from right side) areswapped with 2 bits starting from 4th position (from right side)Using XOR - O(1) time and O(1) spaceWe need to swap two sets of bits. XOR can be used in a similar way as it is used to swap 2 numbers using XOR. The idea is to swap n bits at positions p1 and p2 in a number x by isolating these bit sets, XORing them to find the differences, and then selectively flipping only the bits that need to change, using the property that XOR marks differing bits and applying a second XOR operation restores the correct values in their swapped positions.Step by step approach:Extract the first set of n bits from position p1 by right-shifting and masking with an n-bit maskExtract the second set of n bits from position p2 using the same techniqueXOR these two sets to identify which corresponding bits differ between themPosition these XOR differences back at their original locations (p1 and p2)XOR the original number with these positioned differences to selectively flip only the bits that need to change C++ // C++ Program to swap bits // in a given number #include <bits/stdc++.h> using namespace std; // Function to swap bits in a given number int swapBits(int x, int p1, int p2, int n) { // Move all bits of first set to rightmost side int set1 = (x >> p1) & ((1 << n) - 1); // Move all bits of second set to rightmost side int set2 = (x >> p2) & ((1 << n) - 1); // Xor the two sets int xorVal = (set1 ^ set2); // Put the Xor bits back to their original positions xorVal = (xorVal << p1) | (xorVal << p2); // Xor the 'Xor' with the original number so that the // two sets are swapped int result = x ^ xorVal; return result; } int main() { int res = swapBits(28, 0, 3, 2); cout << res; return 0; } Java // Java Program to swap bits // in a given number class GfG { // Function to swap bits in a given number static int swapBits(int x, int p1, int p2, int n) { // Move all bits of first set to rightmost side int set1 = (x >> p1) & ((1 << n) - 1); // Move all bits of second set to rightmost side int set2 = (x >> p2) & ((1 << n) - 1); // Xor the two sets int xorVal = (set1 ^ set2); // Put the Xor bits back to their original positions xorVal = (xorVal << p1) | (xorVal << p2); // Xor the 'Xor' with the original number so that the // two sets are swapped int result = x ^ xorVal; return result; } public static void main(String[] args) { int res = swapBits(28, 0, 3, 2); System.out.println(res); } } Python # Python Program to swap bits # in a given number # Function to swap bits in a given number def swapBits(x, p1, p2, n): # Move all bits of first set to rightmost side set1 = (x >> p1) & ((1 << n) - 1) # Move all bits of second set to rightmost side set2 = (x >> p2) & ((1 << n) - 1) # Xor the two sets xorVal = (set1 ^ set2) # Put the Xor bits back to their original positions xorVal = (xorVal << p1) | (xorVal << p2) # Xor the 'Xor' with the original number so that the # two sets are swapped result = x ^ xorVal return result if __name__ == "__main__": res = swapBits(28, 0, 3, 2) print(res) C# // C# Program to swap bits // in a given number using System; class GfG { // Function to swap bits in a given number static int swapBits(int x, int p1, int p2, int n) { // Move all bits of first set to rightmost side int set1 = (x >> p1) & ((1 << n) - 1); // Move all bits of second set to rightmost side int set2 = (x >> p2) & ((1 << n) - 1); // Xor the two sets int xorVal = (set1 ^ set2); // Put the Xor bits back to their original positions xorVal = (xorVal << p1) | (xorVal << p2); // Xor the 'Xor' with the original number so that the // two sets are swapped int result = x ^ xorVal; return result; } static void Main(string[] args) { int res = swapBits(28, 0, 3, 2); Console.WriteLine(res); } } JavaScript // JavaScript Program to swap bits // in a given number // Function to swap bits in a given number function swapBits(x, p1, p2, n) { // Move all bits of first set to rightmost side let set1 = (x >> p1) & ((1 << n) - 1); // Move all bits of second set to rightmost side let set2 = (x >> p2) & ((1 << n) - 1); // Xor the two sets let xorVal = (set1 ^ set2); // Put the Xor bits back to their original positions xorVal = (xorVal << p1) | (xorVal << p2); // Xor the 'Xor' with the original number so that the // two sets are swapped let result = x ^ xorVal; return result; } let res = swapBits(28, 0, 3, 2); console.log(res); Output7Checking Each bit - O(1) time and O(1) spaceThe idea is to perform a bit-by-bit swap by iterating through each of the n positions, checking if the corresponding bits at the two positions differ, and if they do, flipping both bits to effectively swap their values - this approach handles the swap one bit at a time rather than operating on the entire bit sequences in a single operation.Step by step approach:For each of the n positions, create masks to isolate individual bits at both locations.Check if the bits at the two positions are different (one is 0 and one is 1).If they differ, flip both bits by clearing the set bit and setting the unset bit.If the bits are identical (both 0 or both 1), no action is needed.Increment both position pointers and continue until all n bits are processed. C++ // C++ Program to swap bits // in a given number #include <bits/stdc++.h> using namespace std; int swapBits(int x, int p1, int p2, int n) { int shift1, shift2, value1, value2; while (n--) { // Setting bit at p1 position to 1 shift1 = 1 << p1; // Setting bit at p2 position to 1 shift2 = 1 << p2; // value1 and value2 will have 0 if num // at the respective positions - p1 and p2 is 0. value1 = ((x & shift1)); value2 = ((x & shift2)); // check if value1 and value2 are different // i.e. at one position bit is set and other it is not if ((!value1 && value2) || (!value2 && value1)) { // if bit at p1 position is set if (value1) { // unset bit at p1 position x = x & (~shift1); // set bit at p2 position x = x | shift2; } // if bit at p2 position is set else { // set bit at p2 position x = x & (~shift2); // unset bit at p2 position x = x | shift1; } } p1++; p2++; } // return final result return x; } int main() { int res = swapBits(28, 0, 3, 2); cout << res; return 0; } Java // Java Program to swap bits // in a given number class GfG { static int swapBits(int x, int p1, int p2, int n) { int shift1, shift2, value1, value2; while (n > 0) { // Setting bit at p1 position to 1 shift1 = 1 << p1; // Setting bit at p2 position to 1 shift2 = 1 << p2; // value1 and value2 will have 0 if num // at the respective positions - p1 and p2 is 0. value1 = (x & shift1); value2 = (x & shift2); // check if value1 and value2 are different // i.e. at one position bit is set and other it is not if ((value1 == 0 && value2 != 0) || (value2 == 0 && value1 != 0)) { // if bit at p1 position is set if (value1 != 0) { // unset bit at p1 position x = x & (~shift1); // set bit at p2 position x = x | shift2; } // if bit at p2 position is set else { // set bit at p2 position x = x & (~shift2); // unset bit at p2 position x = x | shift1; } } p1++; p2++; n--; } // return final result return x; } public static void main(String[] args) { int res = swapBits(28, 0, 3, 2); System.out.println(res); } } Python # Python Program to swap bits # in a given number def swapBits(x, p1, p2, n): shift1 = shift2 = value1 = value2 = 0 while n > 0: # Setting bit at p1 position to 1 shift1 = 1 << p1 # Setting bit at p2 position to 1 shift2 = 1 << p2 # value1 and value2 will have 0 if num # at the respective positions - p1 and p2 is 0. value1 = x & shift1 value2 = x & shift2 # check if value1 and value2 are different # i.e. at one position bit is set and other it is not if (not value1 and value2) or (not value2 and value1): # if bit at p1 position is set if value1: # unset bit at p1 position x = x & (~shift1) # set bit at p2 position x = x | shift2 # if bit at p2 position is set else: # set bit at p2 position x = x & (~shift2) # unset bit at p2 position x = x | shift1 p1 += 1 p2 += 1 n -= 1 # return final result return x if __name__ == "__main__": res = swapBits(28, 0, 3, 2) print(res) C# // C# Program to swap bits // in a given number using System; class GfG { static int swapBits(int x, int p1, int p2, int n) { int shift1, shift2, value1, value2; while (n-- > 0) { // Setting bit at p1 position to 1 shift1 = 1 << p1; // Setting bit at p2 position to 1 shift2 = 1 << p2; // value1 and value2 will have 0 if num // at the respective positions - p1 and p2 is 0. value1 = (x & shift1); value2 = (x & shift2); // check if value1 and value2 are different // i.e. at one position bit is set and other it is not if ((!Convert.ToBoolean(value1) && value2 != 0) || (!Convert.ToBoolean(value2) && value1 != 0)) { // if bit at p1 position is set if (value1 != 0) { // unset bit at p1 position x = x & (~shift1); // set bit at p2 position x = x | shift2; } // if bit at p2 position is set else { // set bit at p2 position x = x & (~shift2); // unset bit at p2 position x = x | shift1; } } p1++; p2++; } // return final result return x; } static void Main(string[] args) { int res = swapBits(28, 0, 3, 2); Console.WriteLine(res); } } JavaScript // JavaScript Program to swap bits // in a given number function swapBits(x, p1, p2, n) { let shift1, shift2, value1, value2; while (n--) { // Setting bit at p1 position to 1 shift1 = 1 << p1; // Setting bit at p2 position to 1 shift2 = 1 << p2; // value1 and value2 will have 0 if num // at the respective positions - p1 and p2 is 0. value1 = x & shift1; value2 = x & shift2; // check if value1 and value2 are different // i.e. at one position bit is set and other it is not if ((!value1 && value2) || (!value2 && value1)) { // if bit at p1 position is set if (value1) { // unset bit at p1 position x = x & (~shift1); // set bit at p2 position x = x | shift2; } // if bit at p2 position is set else { // set bit at p2 position x = x & (~shift2); // unset bit at p2 position x = x | shift1; } } p1++; p2++; } // return final result return x; } let res = swapBits(28, 0, 3, 2); console.log(res); Output7Related Article:Swapping individual bits with XOR Comment More infoAdvertise with us Next Article Analysis of Algorithms K kartik Follow Improve Article Tags : Bit Magic DSA Bitwise-XOR Practice Tags : Bit Magic Similar Reads Basics & PrerequisitesLogic Building ProblemsLogic building is about creating clear, step-by-step methods to solve problems using simple rules and principles. Itâs the heart of coding, enabling programmers to think, reason, and arrive at smart solutions just like we do.Here are some tips for improving your programming logic: Understand the pro 2 min read Analysis of AlgorithmsAnalysis of Algorithms is a fundamental aspect of computer science that involves evaluating performance of algorithms and programs. Efficiency is measured in terms of time and space.BasicsWhy is Analysis Important?Order of GrowthAsymptotic Analysis Worst, Average and Best Cases Asymptotic NotationsB 1 min read Data StructuresArray Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous 3 min read String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut 2 min read Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The 2 min read Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Hereâs the comparison of Linked List vs Arrays Linked List: 2 min read Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first 2 min read Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems 2 min read Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most 4 min read Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of 3 min read Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this 15+ min read AlgorithmsSearching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input 2 min read Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ 3 min read Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution 14 min read Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get 3 min read Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net 3 min read Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of 3 min read Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit 4 min read AdvancedSegment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree 3 min read Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i 2 min read GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br 2 min read Interview PreparationInterview Corner: All Resources To Crack Any Tech InterviewThis article serves as your one-stop guide to interview preparation, designed to help you succeed across different experience levels and company expectations. Here is what you should expect in a Tech Interview, please remember the following points:Tech Interview Preparation does not have any fixed s 3 min read GfG160 - 160 Days of Problem SolvingAre you preparing for technical interviews and would like to be well-structured to improve your problem-solving skills? Well, we have good news for you! GeeksforGeeks proudly presents GfG160, a 160-day coding challenge starting on 15th November 2024. In this event, we will provide daily coding probl 3 min read Practice ProblemGeeksforGeeks Practice - Leading Online Coding PlatformGeeksforGeeks Practice is an online coding platform designed to help developers and students practice coding online and sharpen their programming skills with the following features. GfG 160: This consists of most popular interview problems organized topic wise and difficulty with with well written e 6 min read Problem of The Day - Develop the Habit of CodingDo you find it difficult to develop a habit of Coding? If yes, then we have a most effective solution for you - all you geeks need to do is solve one programming problem each day without any break, and BOOM, the results will surprise you! Let us tell you how:Suppose you commit to improve yourself an 5 min read Like