## Construct XOR tree by Given leaf nodes of Perfect Binary Tree

Given the leaf nodes of a perfect binary tree, the task is to construct the XOR tree and print the root node of this tree.… Read More »

- Equal Sum and XOR of three Numbers
- Nth XOR Fibonacci number
- Queries to check whether all the elements in the given range occurs even number of times
- Maximum XOR of Two Numbers in an Array
- Count of elements which are equal to the XOR of the next two elements
- Minimum given operations required to convert a given binary string to all 1's
- Find number of subarrays with XOR value a power of 2
- Find an N x N grid whose xor of every row and column is equal
- Maximize the Expression | Bit Manipulation
- XOR of elements in an array having prime frequency
- Maximum XOR with given value in the path from root to given node in the tree
- XOR of K smallest prime and composite numbers from the given array
- Find the XOR of first N Prime Numbers
- Absolute difference between the XOR of Non-Prime numbers and Prime numbers of an Array
- Bitwise XOR of elements having odd frequency
- Check if the array has an element which is equal to XOR of remaining elements
- Number of ways to erase exactly one element in the Binary Array to make XOR zero
- XOR of K largest prime and composite numbers from the given array

Given the leaf nodes of a perfect binary tree, the task is to construct the XOR tree and print the root node of this tree.… Read More »

Given a value N and K, the task is to generate N-bits Gray Code starting from the value K. Examples: Input: N = 2, K… Read More »

Given an array arr[] of N distinct positive integers, let’s denote max(i, j) and secondMax(i, j) as the maximum and the second maximum element of… Read More »

Given an array arr[] of non-negative integers, let’s define X as the XOR of all the array elements and S as the sum of all… Read More »

Given two binary string of unequal lengths A and B, the task is to print the binary string which is the XOR of A and… Read More »

Given an array arr[] of N elements, the task is to remove one element from the array such that the XOR value of the array… Read More »

Given two integers A and B, the task is to find an integer X such that (X XOR A) is minimum possible and the count… Read More »

Given two arrays A[] and B[]. The second array B[] contains all the elements of A[] except for 1 extra element. The task is to… Read More »

Given a sequence arr of N positive integers, the task is to find the length of the longest subsequence such that xor of adjacent integers… Read More »

Given a binary array of 0’s and 1’s, the task is to find the number of ways to erase exactly one element from this array… Read More »

Given two positive integers A and B. Let’s define D such that B AND D = D. The task is to maximize the expression A… Read More »

Given an array arr[] of N elements, the task is to find the XOR of the elements which appear odd number of times in the… Read More »

Given an array arr[] of N non-zero positive integers and an integer K, the task is to find the XOR of the K largest prime… Read More »

Given an array arr[] of n elements. The task is to find the count of elements which are equal to the XOR of the next… Read More »