## Number of subarrays have bitwise OR >= K

Given an array arr[] and an integer K, the task is to count the number of sub-arrays having bitwise OR ≥ K. Examples: Input: arr[]… Read More »

## Subset Sum Queries in a Range using Bitset

Given an array[] of N positive integers and M queries. Each query consists of two integers L and R represented by a range. For each… Read More »

## 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 »

## Size of the smallest subset with maximum Bitwise OR

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 »

## Number of pairs with Bitwise OR as Odd number

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 »

## Number of ways to swap two bit of s1 so that bitwise OR of s1 and s2 changes

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 »

## Find subsequences with maximum Bitwise AND and Bitwise OR

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 »

## Assign other value to a variable from two possible values

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 »

## Check whether bitwise OR of N numbers is Even or Odd

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 »

## Count distinct Bitwise OR of all Subarrays

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 »

## Count numbers whose XOR with N is equal to OR with N

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 »

## Find bitwise OR of all possible sub-arrays

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 »

## Sum of bitwise OR of all subarrays

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 »

## Count pairs with Bitwise OR as Even number

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 »

## Bitwise OR (or | ) of a range

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 »