# Tag Archives: Bitwise-XOR

Given an array arr[] of size N ( N is even ), the task is to construct an array B[] such that the sum of… Read More
Given an array arr[] of size N, the task is to find the maximum sum of a subset of the array such that the sum… Read More
Given an array arr[] of size N consisting only of 0s and 1s, the task is to find the minimum number of operations required to… Read More
Given an integer N (N is odd). the task is to construct an array arr[] of size N where 1 ≤ arr[i] ≤ N such… Read More
Given a string S consisting of N digits, the task is to find the minimum number of deletions such that the bitwise Xor of any… Read More
Given three integers A, B, and C. the task is to find the maximum possible sum of three numbers when you are allowed to perform… Read More
Given a binary string S of size N, the task is to find the maximum possible value in exactly K step, where in each step,… Read More
Given an integer N, the task is to find the number of pairs (say {a, b})from 1 to N (both inclusive) that satisfies the condition: … Read More
Given three arrays arr1[], arr2[], and arr3[] consisting of non-negative integers. The task is to find the bitwise XOR of the XOR of all possible… Read More
Given two variables, x, and y, swap two variables without using a third variable. Method 1 (Using Arithmetic Operators): Example 1: The idea is to… Read More
Given an array arr[] containing N integers, the task is to find the XOR of all the elements of this array that are perfect squares.… Read More
Given a binary string S of a number N, the task is to find a number X such that we can minimize the value of… Read More
Bit stands for binary digit. A bit is the basic unit of information and can only have one of two possible values that is 0… Read More
Given an integer N(1 ≤ N ≤ 500), Construct an integer arr[] of length N, such that it should follow all the given conditions below: … Read More
In a party of N people, each person is denoted by an integer. Couples are represented by the same number. Find out the only single… Read More