All about Bit Manipulation
Last Updated :
23 Jul, 2025
Bit Manipulation is a technique used in a variety of problems to get the solution in an optimized way. This technique is very effective from a Competitive Programming point of view. It is all about Bitwise Operators which directly works upon binary numbers or bits of numbers that help the implementation fast. Below are the Bitwise Operators that are used:
- Bitwise AND (&)
- Bitwise OR (|)
- Bitwise XOR (^)
- Bitwise NOT (!)
All data in computer programs are internally stored as bits, i.e., as numbers 0 and 1.
Bit representation
In programming, an n-bit integer is internally stored as a binary number that consists of n bits. For example, the C++ type int is a 32-bit type, which means that every int number consists of 32 bits.
The int number 43 = 00000000000000000000000000101011
The bits in the representation are indexed from right to left. To convert a bit representation bk ···b2 b1 b0 into a number, we can use the formula
bk2k +...+ b222 + b121 + b020.
E.g., 1·25+1·23 +1·21 +1·20 = 43.
The bit representation of a number is either signed or unsigned.
Usually, a signed representation is used, which means that both negative and positive numbers can be represented.
A signed variable of n bits can contain any integer between -2n-1 and 2n-1 - 1
The int type in C++ is a signed type, so an int variable can contain any integer between -231 and 231 - 1.
The first bit in a signed representation is the sign of the number, 0 for non-negative numbers and 1 for negative numbers and the remaining n−1 bits contain the magnitude of the number.
Two’s complement is used, which means that the opposite number of a number is calculated by first inverting all the bits in the number, and then increasing the number by one.
The bit representation of the int number −43 is 11111111111111111111111111010101
In an unsigned representation, only non-negative numbers can be used, but the upper bound for the values is larger.
An unsigned variable of n bits can contain any integer between 0 and 2n −1.
In C++, an unsigned int variable can contain any integer between 0 and 232 −1.
There is a connection between the representations:
A signed number −x equals an unsigned number 2n − x.
For example, the following pseudo-code snippet shows that the signed number
x = −43 equals the unsigned number y = 232 −43:
the pseudo-code snippet shows that the signed number
If a number is larger than the upper bound of the bit representation, the number will overflow. In a signed representation, the next number after 2n-1 - 1 is -2n-1, and in an unsigned representation, the next number after 2n -1 is 0. For example, consider the following pseudo-code snippet:
Initially, the value of x is 231 −1. This is the largest value that can be stored in an int variable, so the next number after 231 −1 is −231 .
Learn more about Bitwise Operators in this article. Below are some common bit operations that are frequently used in programming:
Bitwise Operations:
Below is the table to illustrate the result when the operation is performed using Bitwise Operators. Here 0s or 1s mean a sequence of 0 or 1 respectively.
Operators | Operations | Result |
---|
XOR | X ^ 0s | X |
---|
XOR | X ^ 1s | ~X |
---|
XOR | X ^ X | 0 |
---|
AND | X & 0s | 0 |
---|
AND | X & 1s | X |
---|
AND | X & X | X |
---|
OR | X | 0s | X |
---|
OR | X | 1s | 1s |
---|
OR | X | X | X |
---|
Get Bit:
This method is used to find the bit at a particular position(say i) of the given number N. The idea is to find the Bitwise AND of the given number and 2i that can be represented as (1 << i). If the value return is 1 then the bit at the ith position is set. Otherwise, it is unset.
Below is the pseudo-code for the same:
C++
// Function to get the bit at the
// ith position
bool getBit(int num, int i)
{
// Return true if the bit is
// set. Otherwise return false
return ((num & (1 << i)) != 0);
}
Java
// Function to get the bit at the
// ith position
static boolean getBit(int num, int i)
{
// Return true if the bit is
// set. Otherwise return false
return ((num & (1 << i)) != 0);
}
// This code is contributed by rishavmahato348.
Python3
# Function to get the bit at the
# ith position
def getBit(num, i):
# Return true if the bit is
# set. Otherwise return false
return ((num & (1 << i)) != 0)
# This code is contributed by shivani
C#
// Function to get the bit at the
// ith position
static bool getBit(int num, int i)
{
// Return true if the bit is
// set. Otherwise return false
return ((num & (1 << i)) != 0);
}
// This code is contributed by subhammahato348.
JavaScript
<script>
// Function to get the bit at the
// ith position
function getBit(num, i)
{
// Return true if the bit is
// set. Otherwise return false
return ((num & (1 << i)) != 0);
}
// This code is contributed by Ankita saini
</script>
Set Bit:
This method is used to set the bit at a particular position(say i) of the given number N. The idea is to update the value of the given number N to the Bitwise OR of the given number N and 2i that can be represented as (1 << i). If the value return is 1 then the bit at the ith position is set. Otherwise, it is unset.
Below is the pseudo-code for the same:
C++
// Function to set the ith bit of the
// given number num
int setBit(int num, int i)
{
// Sets the ith bit and return
// the updated value
return num | (1 << i);
}
Java
// Function to set the ith bit of the
// given number num
static int setBit(int num, int i)
{
// Sets the ith bit and return
// the updated value
return num | (1 << i);
}
// This code is contributed by subhammahato348
Python3
# Function to set the ith bit of the
# given number num
def setBit(num, i):
# Sets the ith bit and return
# the updated value
return num | (1 << i)
# This code is contributed by kirti
C#
// Function to set the ith bit of the
// given number num
static int setBit(int num, int i)
{
// Sets the ith bit and return
// the updated value
return num | (1 << i);
}
JavaScript
// Function to set the ith bit of the
// given number num
function setBit(num, i)
{
// Sets the ith bit and return
// the updated value
return num | (1 << i);
}
Clear Bit:
This method is used to clear the bit at a particular position(say i) of the given number N. The idea is to update the value of the given number N to the Bitwise AND of the given number N and the compliment of 2i that can be represented as ~(1 << i). If the value return is 1 then the bit at the ith position is set. Otherwise, it is unset.
Below is the pseudo-code for the same:
C++
// Function to clear the ith bit of
// the given number num
int clearBit(int num, int i)
{
// Create the mask for the ith
// bit unset
int mask = ~(1 << i);
// Return the updated value
return num & mask;
}
Java
// Function to clear the ith bit of
// the given number num
static int clearBit(int num, int i)
{
// Create the mask for the ith
// bit unset
int mask = ~(1 << i);
// Return the updated value
return num & mask;
}
// This code is contributed by subham348
Python3
# Function to clear the ith bit of
# the given number num
def clearBit(num, i):
# Create the mask for the ith
# bit unset
mask = ~(1 << i)
# Return the updated value
return num & mask
# This code is contributed by subhammahato348
C#
// Function to clear the ith bit of
// the given number num
static int clearBit(int num, int i)
{
// Create the mask for the ith
// bit unset
int mask = ~(1 << i);
// Return the updated value
return num & mask;
}
// This code is contributed by Ankita Saini
JavaScript
// Function to clear the ith bit of
// the given number num
function clearBit(num, i)
{
// Create the mask for the ith
// bit unset
let mask = ~(1 << i);
// Return the updated value
return num & mask;
}
// This code is contributed by souravmahato348.
Below is the program that implements the above functionalities:
C++
// C++ program to implement all the
// above functionalities
#include <bits/stdc++.h>
using namespace std;
// Function to get the bit at the
// ith position
bool getBit(int num, int i)
{
// Return true if the ith bit is
// set. Otherwise return false
return ((num & (1 << i)) != 0);
}
// Function to set the ith bit of the
// given number num
int setBit(int num, int i)
{
// Sets the ith bit and return
// the updated value
return num | (1 << i);
}
// Function to clear the ith bit of
// the given number num
int clearBit(int num, int i)
{
// Create the mask for the ith
// bit unset
int mask = ~(1 << i);
// Return the updated value
return num & mask;
}
// Driver Code
int main()
{
// Given number N
int N = 70;
cout << "The bit at the 3rd position from LSB is: "
<< (getBit(N, 3) ? '1' : '0')
<< endl;
cout << "The value of the given number "
<< "after setting the bit at "
<< "LSB is: "
<< setBit(N, 0) << endl;
cout << "The value of the given number "
<< "after clearing the bit at "
<< "LSB is: "
<< clearBit(N, 0) << endl;
return 0;
}
Java
// Java program to implement all the
// above functionalities
import java.io.*;
class GFG{
// Function to get the bit at the
// ith position
static boolean getBit(int num, int i)
{
// Return true if the ith bit is
// set. Otherwise return false
return ((num & (1 << i)) != 0);
}
// Function to set the ith bit of the
// given number num
static int setBit(int num, int i)
{
// Sets the ith bit and return
// the updated value
return num | (1 << i);
}
// Function to clear the ith bit of
// the given number num
static int clearBit(int num, int i)
{
// Create the mask for the ith
// bit unset
int mask = ~(1 << i);
// Return the updated value
return num & mask;
}
// Driver Code
public static void main(String[] args)
{
// Given number N
int N = 70;
System.out.println("The bit at the 3rd position from LSB is: " +
(getBit(N, 3) ? '1' : '0'));
System.out.println("The value of the given number " +
"after setting the bit at " +
"LSB is: " + setBit(N, 0));
System.out.println("The value of the given number " +
"after clearing the bit at " +
"LSB is: " + clearBit(N, 0));
}
}
// This code is contributed by souravmahato348
Python
# Python program to implement all the
# above functionalities
# Function to get the bit at the
# ith position
def getBit( num, i):
# Return true if the ith bit is
# set. Otherwise return false
return ((num & (1 << i)) != 0)
# Function to set the ith bit of the
# given number num
def setBit( num, i):
# Sets the ith bit and return
# the updated value
return num | (1 << i)
# Function to clear the ith bit of
# the given number num
def clearBit( num, i):
# Create the mask for the ith
# bit unset
mask = ~(1 << i)
# Return the updated value
return num & mask
# Driver Code
# Given number N
N = 70
print"The bit at the 3rd position from LSB is: " , 1 if (getBit(N, 3)) else '0'
print"The value of the given number" , "after setting the bit at","LSB is: " , setBit(N, 0)
print"The value of the given number" , "after clearing the bit at","LSB is: " , clearBit(N, 0)
# This code is contributed by shivanisinghss2110
C#
// C# program to implement all the
// above functionalities
using System;
class GFG {
// Function to get the bit at the
// ith position
static bool getBit(int num, int i)
{
// Return true if the ith bit is
// set. Otherwise return false
return ((num & (1 << i)) != 0);
}
// Function to set the ith bit of the
// given number num
static int setBit(int num, int i)
{
// Sets the ith bit and return
// the updated value
return num | (1 << i);
}
// Function to clear the ith bit of
// the given number num
static int clearBit(int num, int i)
{
// Create the mask for the ith
// bit unset
int mask = ~(1 << i);
// Return the updated value
return num & mask;
}
// Driver Code
public static void Main()
{
// Given number N
int N = 70;
Console.WriteLine("The bit at the 3rd position form LSB is: "
+ (getBit(N, 3) ? '1' : '0'));
Console.WriteLine("The value of the given number "
+ "after setting the bit at "
+ "LSB is: " + setBit(N, 0));
Console.WriteLine("The value of the given number "
+ "after clearing the bit at "
+ "LSB is: " + clearBit(N, 0));
}
}
// This code is contributed by rishavmahato348.
JavaScript
<script>
// Javascript program to implement all
// the above functionalities
// Function to get the bit at the
// ith position
function getBit(num, i)
{
// Return true if the ith bit is
// set. Otherwise return false
return ((num & (1 << i)) != 0);
}
// Function to set the ith bit of the
// given number num
function setBit(num, i)
{
// Sets the ith bit and return
// the updated value
return num | (1 << i);
}
// Function to clear the ith bit of
// the given number num
function clearBit(num, i)
{
// Create the mask for the ith
// bit unset
let mask = ~(1 << i);
// Return the updated value
return num & mask;
}
// Driver code
// Given number N
let N = 70;
document.write("The bit at the 3rd position from LSB is: " +
(getBit(N, 3) ? '1' : '0') + "</br>");
document.write("The value of the given number " +
"after setting the bit at " +
"LSB is: " + setBit(N, 0) + "</br>");
document.write("The value of the given number " +
"after clearing the bit at " +
"LSB is: " + clearBit(N, 0) + "</br>");
// This code is contributed by divyeshrabadiya07
</script>
OutputThe bit at the 3rd position from LSB is: 0
The value of the given number after setting the bit at LSB is: 71
The value of the given number after clearing the bit at LSB is: 70
Time Complexity: O(1)
Auxiliary Space: O(1)
Application of Bitwise Operator
- Bitwise operations are prominent in embedded systems, control systems, etc where memory(data transmission/data points) is still an issue.
- They are also useful in networking where it is important to reduce the amount of data, so booleans are packed together. Packing them together and taking them apart use bitwise operations and shift instructions.
- Bitwise operations are also heavily used in the compression and encryption of data.
- Useful in graphics programming, older GUIs are heavily dependent on bitwise operations like XOR(^) for selection highlighting and other overlays.
Similar Reads
Basics & Prerequisites
Data Structures
Getting Started with Array Data StructureArray is a collection of items of the same variable type that are stored at contiguous memory locations. It is one of the most popular and simple data structures used in programming. Basic terminologies of ArrayArray Index: In an array, elements are identified by their indexes. Array index starts fr
14 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
Algorithms
Searching 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
Advanced
Segment 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 Preparation
Practice Problem