## Maximum XOR with given value in the path from root to given node in the tree

Given a tree with N distinct nodes from the range [1, n] and two integers x and val. The task is to find the maximum… Read More »

- Find maximum xor of k elements in an array
- XOR of all the elements in the given range [L, R]
- Find XOR of numbers from the range [L, R]
- Equal Sum and XOR of three Numbers
- Range Queries to Find number of sub-arrays with a given xor
- Quadruplet pair with XOR zero in the given Array
- Alternate XOR operations on sorted array
- Minimum Bitwise XOR operations to make any two array elements equal
- Sum of XOR of all sub-arrays of length K
- Find array such that no subarray has xor zero or Y
- Find a number which give minimum sum when XOR with every number of array of integers
- Longest Subarray having strictly positive XOR
- Find a sub matrix with maximum XOR
- Choose X such that (A xor X) + (B xor X) is minimized
- Find a partition point in array to maximize its xor sum
- Minimizing array sum by applying XOR operation on all elements of the array
- Print steps to make a number in form of 2^X - 1
- Generate all binary strings of length n with sub-string "01" appearing exactly twice
- XOR in a range of a binary array
- Convert given integer X to the form 2^N - 1
- XOR of all the nodes in the sub-tree of the given node
- Create a sequence whose XOR of elements is y
- Total pairs in an array such that the bitwise AND, bitwise OR and bitwise XOR of LSB is 1
- Check if a number from every row can be selected such that xor of the numbers is greater than zero
- Count of sub-arrays whose elements can be re-arranged to form palindromes
- Find the node whose xor with x gives minimum value
- Number of ways for playing first move optimally in a NIM game
- Find the root of the sub-tree whose weighted sum XOR with X is maximum
- Find the node whose xor with x gives maximum value
- Maximum XOR with given value in the path from root to given node in the tree

Given a tree with N distinct nodes from the range [1, n] and two integers x and val. The task is to find the maximum… Read More »

Given an integer N. The task is to count the numbers of pairs of integers A and B such that A + B + N… Read More »

Given an array arr[] of N integers such that any two adjacent elements in the array differ at only one position in their binary representation.… Read More »

Given an array arr[] of integers of size N and an integer K. One can perform the Bitwise XOR operation between any array element and… Read More »

Given an array arr[] of N integers and an integer K. The task is to find the maximum xor subset of size K of the… Read More »

Given a binary array arr[] of size N and some queries. Each query represents an index range [l, r]. The task is to find the… Read More »

Given an array arr[] and two integers X and K. The task is to perform the following operation on array K times: Sort the array.… Read More »

Given two integers X (1 ≤ X ≤ 15) and Y. The task is to find an array of the maximum possible length N such… Read More »

Given an array a of size N. The task is to find an index ‘i’ (1 <= i <= N) such that (a[1] ^ …… Read More »

Given an array arr[] of N non-negative integers. The task is to find the length of the longest sub-array such that XOR of all the… Read More »

Given two integers L and R, the task is to find the XOR of elements of the range [L, R]. Examples :‘ Input: L =… Read More »

Given an integer x. The task is to convert x to the form 2n – 1 by performing the following operations in specified order on… Read More »

Given an array of length n ( n > k), we have to find the sum of xor of all the elements of the sub-arrays… Read More »

Problem Given a square matrix of side N we have to find a submatrix such that bitwise XOR of its elements is maximum, and we… Read More »

Given a tree, and the weights of all the nodes, the task is to find the root of the sub-tree whose weighted sum XOR with… Read More »