# Tag Archives: Bitwise-XOR

Given a positive integer value V, the task is to find the maximum XOR of two numbers such that their product is equal to the… Read More
Given an integer n, you need to find the largest integer m (m < n) such that m XOR n is a palindrome. If there… Read More
Given an integer array arr[] of size N, the task is to count the number of pairs whose BITWISE AND and BITWISE XOR are equal.… Read More
Given a range, find the XOR of the smallest and largest triangular numbers within that range. A triangular number is a number that can be… Read More
Given two strings s1 and s2, the task is to find the length of the longest common substring of s1 and s2 such that the… Read More
Given a string s consisting of digits and an integer K, the task is to remove exactly K digits from the string so that the… Read More
Given three distinct integers X, Y, Z. Find an integer N that after performing XOR of each element, integers must follow that X should be… Read More
Given an integer array A of size N, and Q queries. In each query, you are given an integer X. Create a new sequence X^A[i], say… Read More
Given an integer N, the task is to find X and Y where X is the number of quadruples of positive integers (A, B, C,… Read More
Given two numbers a and b. Find the minimum number of steps required to make the number of the set (1) and unset(0) bits equal… Read More
Given an array arr[] of length N, the task is to check if we can make all elements of the array equal by taking two… Read More
Given an array arr[] of size N and an integer K, the task is to find the number of pairs in the array such that… Read More
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