Skip to content

Tag Archives: Bitwise-XOR

Given an array arr of length N of distinct numbers and an integer X, the task is to find the minimum number of elements that… Read More
Given an array arr[] of size N, the task is to find if there exists a pair in the array, such that their bitwise XOR… Read More
Given an integer K and an array arr[] of size N, the task is to choose two elements from the array in such a way… Read More
Given a binary matrix arr[][] of N rows and M columns. The task is to find the number of cells in the matrix, where Bitwise… Read More
Given an array arr[] containing N positive integers, the task is to add an integer such that the bitwise Xor of the new array becomes… Read More
Given an integer N, the task is to count the number of integers (say x) in the range [0, 2N−1] such that x⊕(x+1) = (x+2)⊕(x+3).… Read More
Given an array arr[] which contains N positive integers and an integer K. The task is to count all triplets whose XOR is equal to… Read More
Given a binary array arr[] of size N and an integer K, the task is to check whether the binary array can be turned into… Read More
Given an array arr[] of size N, the task is to check if the array elements can be rearranged in a way such that the… Read More
Given a singly linked list, the task is to Count the pairs of nodes with greater Bitwise AND than Bitwise XOR. Examples: Input: list: 1->4->2->6->3Output:… Read More
Given a binary string str of size N, the task is to calculate the bitwise XOR of all substrings of str. Examples: Input: str =… Read More
Given an array arr that contains N positive Integers. Find the count of all possible pairs whose bit wise XOR value is greater than bit… Read More
Given an array arr that contains N positive Integers. Find the count of all possible pairs whose bitwise XOR value is greater than bitwise AND… Read More
Given a tree of having N nodes rooted at node 0, and an array val[] denoting the value at each node, the task is to… Read More
Given an integer N, the task is to generate a permutation from 1 to N such that the bitwise XOR of differences between adjacent elements… Read More

Start Your Coding Journey Now!