## Sum of Bitwise-OR of all subarrays of a given Array | Set 2

Give an array of positive integers. The task is to find the total sum after performing the bit wise OR operation on all the sub… Read More »

- Sum of bitwise OR of all subarrays
- Check whether bitwise OR of N numbers is Even or Odd
- Sum of Bitwise-OR of all subarrays of a given Array | Set 2
- Number of pairs with Bitwise OR as Odd number
- Count numbers whose XOR with N is equal to OR with N
- Count pairs with Bitwise OR as Even number
- Assign other value to a variable from two possible values
- Bitwise OR (or | ) of a range
- Find subsequences with maximum Bitwise AND and Bitwise OR
- Size of the smallest subset with maximum Bitwise OR
- Count distinct Bitwise OR of all Subarrays
- Find bitwise OR of all possible sub-arrays
- Number of ways to swap two bit of s1 so that bitwise OR of s1 and s2 changes

Give an array of positive integers. The task is to find the total sum after performing the bit wise OR operation on all the sub… Read More »

Given an array of positive integers. The task is to find the size of the smallest subset such that the Bitwise OR of that set… Read More »

Given an array A[] of size N. The task is to find the how many pair(i, j) exists such that A[i] OR A[j] is odd.… Read More »

Given two binary numbers strings and of length . Find the number of ways of swapping two bits in s1(only s1 not s2) so that… Read More »

Given an array of n elements. The task is to print the maximum sum by selecting two subsequences of the array (not necessarily different) such… Read More »

Suppose a variable x can have only two possible values a and b, and you wish to assign to x the value other than its… Read More »

Given an array arr[] containing N numbers. The task is to check whether the bitwise-OR of the given N numbers is even or odd. Examples:… Read More »

Given an array A of non-negative integers, where . The task is to count number of distinct possible results obtained by taking the bitwise OR… Read More »

Given a number N, the task is to find the count of X such that N XOR X == N OR X, where 0<=X<=N Examples:… Read More »

Given an array A of size N where, . The task is to find the OR of all possible sub-arrays of A and then the… Read More »

Give an array of positive integers, find the total sum after performing the bit wise OR operation on all the sub arrays of a given… Read More »

Given an array A[] of size N. The task is to find the how many pair(i, j) exists such that A[i] OR A[j] is even.… Read More »

Given two integers L and R. Determine the bitwise OR of all the integers in the range [L, R] (both inclusive). Examples: Input: L =… Read More »

Given an array of N integers. The bitwise OR of all the elements of the array has to be maximized by performing one task. The… Read More »

Given an integer n, find the largest possible set of non negative integers with bitwise OR equal to n. Examples: Input : n = 5… Read More »