Skip to content

Tag Archives: Bitwise-XOR

Given an integer N, the task is to find the count total number of pairs (P, Q) from the range 0 ≤ P, Q <… Read More
Given an array arr[] of size N, the task is to split the array into two subsets such that the Bitwise XOR between the maximum… Read More
Given a XOR linked list, the task is to pairwise swap the elements of the given XOR linked list . Examples: Input: 4 7 9… Read More
Given an XOR linked list, the task is to remove the first node of the XOR linked list. Examples: Input: XLL = 4 < –… Read More
Given a XOR linked list and an integer K, the task is to reverse every K nodes in the given XOR linked list. Examples: Input:… Read More
Given an array arr[] of size N and an integer K, the task is to minimize the sum of difference between the maximum and minimum… Read More
Given an array arr[] of size N, the task is to check if any subarray of size K exists in the array or not, whose… Read More
Given a XOR linked list, the task is to reverse the XOR linked list. Examples: Input: 4 <–> 7 <–> 9 <–> 7Output: 7 <–>… Read More
Given a binary matrix M[][] of dimensions N x N, the task is to make every pair of adjacent cells in the same row or… Read More
Given an array Arr[] of N ( 1 ≤ N ≤ 105)integers, the task is to generate an array B[] consisting of N non-zero elements,… Read More
Given a 2D matrix mat[][] of size N * M, the task is to find the median of Bitwise XOR of all possible submatrices from… Read More
Given an array arr[] of size N, the task is to find all the triplets (i, j, k) such that replacing the elements of the… Read More
Given an integer N, the task is to find the Bitwise XOR of all odd numbers in the range [1, N]. Examples:   Input: 11Output: 2Explanation:… Read More
Given an array arr[] of length N, the task for every array element is to print the sum of its Bitwise XOR with all other… Read More
Given two integers L and R, the task is to calculate Bitwise XOR of all even numbers in the range [L, R]. Examples: Example: Input: L… Read More

Start Your Coding Journey Now!