# Tag Archives: Bitwise-XOR

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
Given a linked list containing N nodes of binary numbers, the task is to check whether it is possible to rearrange the linked list in… Read More
Given an array arr of positive integers of size N, the task is to split the array into 3 partitions, such that the sum of… Read More
Given an integer N count the number of values of X such that  X⊕N > N, where  ⊕ denotes bitwise  XOR operation Examples: Input: N =… Read More
Given an integer N, the task is to print a permutation of numbers from 0 to N-1, such that: There is no duplicate element in… Read More
Given an array arr of length N, the task is to rearrange the elements of given array such that for each element, its bitwise XOR… Read More
Given an integer N, consider an array having elements in the range [0, N-1] such that the maximum Bitwise XOR of all adjacent pairs is… Read More
Given an integer N, the task is to find the number of distinct values possible for the bit-wise XOR of X and Y where 1… Read More