Number whose sum of XOR with given array range is maximum
Last Updated :
23 Feb, 2023
You are given a sequence of N integers and Q queries. In each query, you are given two parameters L and R. You have to find the smallest integer X such that 0 <= X < 2^31 and the sum of XOR of x with all elements in range [L, R] is maximum possible.
Examples :
Input : A = {20, 11, 18, 2, 13}
Three queries as (L, R) pairs
1 3
3 5
2 4
Output : 2147483629
2147483645
2147483645
Approach: The binary representation of each element and X, we can observe that each bit is independent and the problem can be solved by iterating over each bit. Now basically for each bit we need to count the number of 1's and 0's in the given range, if the number of 1's are more then you have to set that bit of X to 0 so that the sum is maximum after xor with X else if number of 0's are more then you have to set that bit of X to 1. If the number of 1's and 0's are equal then we can set that bit of X to any one of 1 or 0 because it will not affect the sum, but we have to minimize the value of X so we will take that bit 0.
Now, to optimize the solution we can pre-calculate the count of 1's at each bit position of the numbers up to that position by making a prefix array this will take O(n) time. Now for each query number of 1's will be the number of 1's up to Rth position - number of 1's up to (L-1)th position.
C++
// CPP program to find smallest integer X
// such that sum of its XOR with range is
// maximum.
#include <bits/stdc++.h>
using namespace std;
#define MAX 2147483647
int one[100001][32];
// Function to make prefix array which
// counts 1's of each bit up to that number
void make_prefix(int A[], int n)
{
for (int j = 0; j < 32; j++)
one[0][j] = 0;
// Making a prefix array which sums
// number of 1's up to that position
for (int i = 1; i <= n; i++)
{
int a = A[i - 1];
for (int j = 0; j < 32; j++)
{
int x = pow(2, j);
// If j-th bit of a number is set then
// add one to previously counted 1's
if (a & x)
one[i][j] = 1 + one[i - 1][j];
else
one[i][j] = one[i - 1][j];
}
}
}
// Function to find X
int Solve(int L, int R)
{
int l = L, r = R;
int tot_bits = r - l + 1;
// Initially taking maximum value all bits 1
int X = MAX;
// Iterating over each bit
for (int i = 0; i < 31; i++)
{
// get 1's at ith bit between the
// range L-R by subtracting 1's till
// Rth number - 1's till L-1th number
int x = one[r][i] - one[l - 1][i];
// If 1's are more than or equal to 0's
// then unset the ith bit from answer
if (x >= tot_bits - x)
{
int ith_bit = pow(2, i);
// Set ith bit to 0 by doing
// Xor with 1
X = X ^ ith_bit;
}
}
return X;
}
// Driver program
int main()
{
// Taking inputs
int n = 5, q = 3;
int A[] = { 210, 11, 48, 22, 133 };
int L[] = { 1, 4, 2 }, R[] = { 3, 14, 4 };
make_prefix(A, n);
for (int j = 0; j < q; j++)
cout << Solve(L[j], R[j]) << endl;
return 0;
}
// Java program to find smallest integer X
// such that sum of its XOR with range is
// maximum.
import java.lang.Math;
class GFG {
private static final int MAX = 2147483647;
static int[][] one = new int[100001][32];
// Function to make prefix array which counts
// 1's of each bit up to that number
static void make_prefix(int A[], int n)
{
for (int j = 0; j < 32; j++)
one[0][j] = 0;
// Making a prefix array which sums
// number of 1's up to that position
for (int i = 1; i <= n; i++)
{
int a = A[i - 1];
for (int j = 0; j < 32; j++)
{
int x = (int)Math.pow(2, j);
// If j-th bit of a number is set then
// add one to previously counted 1's
if ((a & x) != 0)
one[i][j] = 1 + one[i - 1][j];
else
one[i][j] = one[i - 1][j];
}
}
}
// Function to find X
static int Solve(int L, int R)
{
int l = L, r = R;
int tot_bits = r - l + 1;
// Initially taking maximum
// value all bits 1
int X = MAX;
// Iterating over each bit
for (int i = 0; i < 31; i++)
{
// get 1's at ith bit between the range
// L-R by subtracting 1's till
// Rth number - 1's till L-1th number
int x = one[r][i] - one[l - 1][i];
// If 1's are more than or equal to 0's
// then unset the ith bit from answer
if (x >= tot_bits - x)
{
int ith_bit = (int)Math.pow(2, i);
// Set ith bit to 0 by
// doing Xor with 1
X = X ^ ith_bit;
}
}
return X;
}
// Driver program
public static void main(String[] args)
{
// Taking inputs
int n = 5, q = 3;
int A[] = { 210, 11, 48, 22, 133 };
int L[] = { 1, 4, 2 }, R[] = { 3, 14, 4 };
make_prefix(A, n);
for (int j = 0; j < q; j++)
System.out.println(Solve(L[j], R[j]));
}
}
// This code is contributed by Smitha
# Python3 program to find smallest integer X
# such that sum of its XOR with range is
# maximum.
import math
one = [[0 for x in range(32)]
for y in range(100001)]
MAX = 2147483647
# Function to make prefix array
# which counts 1's of each bit
# up to that number
def make_prefix(A, n) :
global one, MAX
for j in range(0 , 32) :
one[0][j] = 0
# Making a prefix array which
# sums number of 1's up to
# that position
for i in range(1, n+1) :
a = A[i - 1]
for j in range(0 , 32) :
x = int(math.pow(2, j))
# If j-th bit of a number
# is set then add one to
# previously counted 1's
if (a & x) :
one[i][j] = 1 + one[i - 1][j]
else :
one[i][j] = one[i - 1][j]
# Function to find X
def Solve(L, R) :
global one, MAX
l = L
r = R
tot_bits = r - l + 1
# Initially taking maximum
# value all bits 1
X = MAX
# Iterating over each bit
for i in range(0, 31) :
# get 1's at ith bit between the
# range L-R by subtracting 1's till
# Rth number - 1's till L-1th number
x = one[r][i] - one[l - 1][i]
# If 1's are more than or equal
# to 0's then unset the ith bit
# from answer
if (x >= (tot_bits - x)) :
ith_bit = pow(2, i)
# Set ith bit to 0 by
# doing Xor with 1
X = X ^ ith_bit
return X
# Driver Code
n = 5
q = 3
A = [ 210, 11, 48, 22, 133 ]
L = [ 1, 4, 2 ]
R = [ 3, 14, 4 ]
make_prefix(A, n)
for j in range(0, q) :
print (Solve(L[j], R[j]),end="\n")
# This code is contributed by
# Manish Shaw(manishshaw1)
// C# program to find smallest integer X
// such that sum of its XOR with range is
// maximum.
using System;
using System.Collections.Generic;
class GFG{
static int MAX = 2147483647;
static int [,]one = new int[100001,32];
// Function to make prefix
// array which counts 1's
// of each bit up to that number
static void make_prefix(int []A, int n)
{
for (int j = 0; j < 32; j++)
one[0,j] = 0;
// Making a prefix array which sums
// number of 1's up to that position
for (int i = 1; i <= n; i++)
{
int a = A[i - 1];
for (int j = 0; j < 32; j++)
{
int x = (int)Math.Pow(2, j);
// If j-th bit of a number is set then
// add one to previously counted 1's
if ((a & x) != 0)
one[i, j] = 1 + one[i - 1, j];
else
one[i,j] = one[i - 1, j];
}
}
}
// Function to find X
static int Solve(int L, int R)
{
int l = L, r = R;
int tot_bits = r - l + 1;
// Initially taking maximum
// value all bits 1
int X = MAX;
// Iterating over each bit
for (int i = 0; i < 31; i++)
{
// get 1's at ith bit between the
// range L-R by subtracting 1's till
// Rth number - 1's till L-1th number
int x = one[r, i] - one[l - 1, i];
// If 1's are more than or
// equal to 0's then unset
// the ith bit from answer
if (x >= tot_bits - x)
{
int ith_bit = (int)Math.Pow(2, i);
// Set ith bit to 0 by doing
// Xor with 1
X = X ^ ith_bit;
}
}
return X;
}
// Driver Code
public static void Main()
{
// Taking inputs
int n = 5, q = 3;
int []A = {210, 11, 48, 22, 133};
int []L = {1, 4, 2};
int []R = {3, 14, 4};
make_prefix(A, n);
for (int j = 0; j < q; j++)
Console.WriteLine(Solve(L[j], R[j]));
}
}
// This code is contributed by
// Manish Shaw (manishshaw1)
<?php
error_reporting(0);
// PHP program to find smallest integer X
// such that sum of its XOR with range is
// maximum.
$one = array();
$MAX = 2147483647;
// Function to make prefix array
// which counts 1's of each bit
// up to that number
function make_prefix($A, $n)
{
global $one, $MAX;
for ($j = 0; $j < 32; $j++)
$one[0][$j] = 0;
// Making a prefix array which
// sums number of 1's up to
// that position
for ($i = 1; $i <= $n; $i++)
{
$a = $A[$i - 1];
for ($j = 0; $j < 32; $j++)
{
$x = pow(2, $j);
// If j-th bit of a number
// is set then add one to
// previously counted 1's
if ($a & $x)
$one[$i][$j] = 1 + $one[$i - 1][$j];
else
$one[$i][$j] = $one[$i - 1][$j];
}
}
}
// Function to find X
function Solve($L, $R)
{
global $one, $MAX;
$l = $L; $r = $R;
$tot_bits = $r - $l + 1;
// Initially taking maximum
// value all bits 1
$X = $MAX;
// Iterating over each bit
for ($i = 0; $i < 31; $i++)
{
// get 1's at ith bit between the
// range L-R by subtracting 1's till
// Rth number - 1's till L-1th number
$x = $one[$r][$i] - $one[$l - 1][$i];
// If 1's are more than or equal
// to 0's then unset the ith bit
// from answer
if ($x >= ($tot_bits - $x))
{
$ith_bit = pow(2, $i);
// Set ith bit to 0 by
// doing Xor with 1
$X = $X ^ $ith_bit;
}
}
return $X;
}
// Driver Code
$n = 5; $q = 3;
$A = [ 210, 11, 48, 22, 133 ];
$L = [ 1, 4, 2 ];
$R = [ 3, 14, 4 ];
make_prefix($A, $n);
for ($j = 0; $j < $q; $j++)
echo (Solve($L[$j], $R[$j]). "\n");
// This code is contributed by
// Manish Shaw(manishshaw1)
?>
<script>
// Javascript program to find smallest integer X
// such that sum of its XOR with range is
// maximum.
const MAX = 2147483647;
let one = new Array(100001);
for (let i = 0; i < 100001; i++)
one[i] = new Array(32);
// Function to make prefix array which
// counts 1's of each bit up to that number
function make_prefix(A, n)
{
for (let j = 0; j < 32; j++)
one[0][j] = 0;
// Making a prefix array which sums
// number of 1's up to that position
for (let i = 1; i <= n; i++)
{
let a = A[i - 1];
for (let j = 0; j < 32; j++)
{
let x = Math.pow(2, j);
// If j-th bit of a number is set then
// add one to previously counted 1's
if (a & x)
one[i][j] = 1 + one[i - 1][j];
else
one[i][j] = one[i - 1][j];
}
}
}
// Function to find X
function Solve(L, R)
{
let l = L, r = R;
let tot_bits = r - l + 1;
// Initially taking maximum value all bits 1
let X = MAX;
// Iterating over each bit
for (let i = 0; i < 31; i++)
{
// get 1's at ith bit between the
// range L-R by subtracting 1's till
// Rth number - 1's till L-1th number
let x = one[r][i] - one[l - 1][i];
// If 1's are more than or equal to 0's
// then unset the ith bit from answer
if (x >= tot_bits - x)
{
let ith_bit = Math.pow(2, i);
// Set ith bit to 0 by doing
// Xor with 1
X = X ^ ith_bit;
}
}
return X;
}
// Driver program
// Taking inputs
let n = 5, q = 3;
let A = [ 210, 11, 48, 22, 133 ];
let L = [ 1, 4, 2 ], R = [ 3, 14, 4 ];
make_prefix(A, n);
for (let j = 0; j < q; j++)
document.write(Solve(L[j], R[j]) + "<br>");
</script>
Output :
2147483629
2147483647
2147483629
Time complexity: O(n)
Auxiliary Space: O(n)
Approach 2 :
From the below table you can see that if we are given a number n, our answer would "N-n", where N is all 1s.
And we can get n (which is sum of all integers from A[i] to A[j]) using "prefixSum[j] - prefixSum[i]".
| Number (n) | 1 | 0 | 0 | 1 | 0 | 0 | 1 |
| All 1s (N) | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| N-n | 0 | 1 | 1 | 0 | 1 | 1 | 0 |
// CPP program to find smallest integer X
// such that sum of its XOR with range is
// maximum.
#include <bits/stdc++.h>
using namespace std;
// MAX is (1 << 31) -1 or in other terms 2^31 - 1
#define MAX 2147483647
int prefixSum[100001];
// Function to make prefix Sum array which
void make_prefix(int A[], int n)
{
prefixSum[0] = A[0];
for (int i = 1; i < n; i++)
prefixSum[i] = prefixSum[i - 1] + A[i];
}
// Function to find X
int Solve(int A[], int L, int R)
{
int n = prefixSum[R] - prefixSum[L] + A[L];
return MAX - n;
}
// Driver program
int main()
{
// Taking inputs
int n = 5, q = 3;
int A[] = { 210, 11, 48, 22, 133 };
int L[] = { 1, 4, 2 }, R[] = { 3, 4, 4 };
make_prefix(A, n);
for (int j = 0; j < q; j++)
cout << Solve(A, L[j], R[j]) << endl;
return 0;
}
// Java program to find smallest integer X
// such that sum of its XOR with range is
// maximum.
import java.util.*;
class GFG
{
// MAX is (1 << 31) -1 or in other terms 2^31 - 1
static int MAX = 2147483647;
static int[] prefixSum;
// Function to make prefix Sum array which
static void make_prefix(int A[], int n)
{
prefixSum[0] = A[0];
for (int i = 1; i < n; i++)
prefixSum[i] = prefixSum[i - 1] + A[i];
}
// Function to find X
static int Solve(int A[], int L, int R)
{
int n = prefixSum[R] - prefixSum[L] + A[L];
return MAX - n;
}
// Driver program
public static void main(String[] args)
{
prefixSum = new int[100001];
// Taking inputs
int n = 5, q = 3;
int A[] = { 210, 11, 48, 22, 133 };
int L[] = { 1, 4, 2 }, R[] = { 3, 4, 4 };
make_prefix(A, n);
for (int j = 0; j < q; j++)
System.out.println(Solve(A, L[j], R[j]));
}
}
// This code is contributed by karandeep1234
# CPP program to find smallest integer X
# such that sum of its XOR with range is
# maximum.
MAX = 2147483647
prefixSum = [0] * 100001
# Function to make prefix Sum array which
def make_prefix(A, n):
global prefixSum
prefixSum[0] = A[0]
for i in range(1, n):
prefixSum[i] = prefixSum[i - 1] + A[i]
# Function to find X
def Solve(A, L, R):
global MAX, prefixSum
n = prefixSum[R] - prefixSum[L] + A[L]
return MAX - n
# Driver program
if __name__ == "__main__":
# Taking inputs
n, q = 5, 3
A = [210, 11, 48, 22, 133]
L = [1, 4, 2]
R = [3, 4, 4]
make_prefix(A, n)
for j in range(q):
print(Solve(A, L[j], R[j]))
# This code is contributed by bhardwajji
// C# program to find smallest integer X
// such that sum of its XOR with range is
// maximum.
using System;
class GFG {
// MAX is (1 << 31) -1 or in other terms 2^31 - 1
static int MAX = 2147483647;
static int[] prefixSum;
// Function to make prefix Sum array which
static void make_prefix(int[] A, int n)
{
prefixSum[0] = A[0];
for (int i = 1; i < n; i++)
prefixSum[i] = prefixSum[i - 1] + A[i];
}
// Function to find X
static int Solve(int[] A, int L, int R)
{
int n = prefixSum[R] - prefixSum[L] + A[L];
return MAX - n;
}
// Driver program
public static void Main(string[] args)
{
prefixSum = new int[100001];
// Taking inputs
int n = 5, q = 3;
int[] A = { 210, 11, 48, 22, 133 };
int[] L = { 1, 4, 2 }, R = { 3, 4, 4 };
make_prefix(A, n);
for (int j = 0; j < q; j++)
Console.WriteLine(Solve(A, L[j], R[j]));
}
}
// This code is contributed by karandeep1234
// JAVASCRIPT program to find smallest integer X
// such that sum of its XOR with range is
// maximum.
let prefixSum = [];
// Function to make prefix Sum array which
function make_prefix(A, n)
{
for(let i = 0; i < n; i++)
{
prefixSum.push(0);
}
for (let i = 1; i < n; i++)
prefixSum[i] = prefixSum[i - 1] + A[i];
}
// Function to find X
function Solve(A, L, R)
{
let n = prefixSum[R] - prefixSum[L] + A[L];
// MAX is (1 << 31) -1 or in other terms 2^31 - 1
let MAX = 2147483647;
return MAX - n;
}
// Driver program
// Taking inputs
let n = 5, q = 3;
let A = [ 210, 11, 48, 22, 133 ];
let L = [ 1, 4, 2 ], R = [ 3, 4, 4 ];
make_prefix(A, n);
for (let j = 0; j < q; j++)
console.log(Solve(A, L[j], R[j]));
// This code is contributed by garg28harsh.
Time complexity: O(n)
Auxiliary Space: O(n)
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem