## Pairs of strings which on concatenating contains each character of “string”

Given an array of strings arr[]. The task is to find the count of unordered pairs of strings (arr[i], arr[j]), which on concatenation contains each… Read More »

- Number of subarrays have bitwise OR >= K
- Sum of Bitwise-OR of all subarrays of a given Array | Set 2
- Sum of Bitwise-OR of all Submatrices
- Check whether bitwise OR of N numbers is Even or Odd
- Find subsequences with maximum Bitwise AND and Bitwise OR
- Subset Sum Queries in a Range using Bitset
- Count distinct Bitwise OR of all Subarrays
- Size of the smallest subset with maximum Bitwise OR
- Number of pairs with Bitwise OR as Odd number
- Assign other value to a variable from two possible values
- Count numbers whose XOR with N is equal to OR with N
- Number of ways to swap two bit of s1 so that bitwise OR of s1 and s2 changes
- Bitwise OR of N binary strings
- Pairs of strings which on concatenating contains each character of "string"
- Count pairs with bitwise OR less than Max

Given an array of strings arr[]. The task is to find the count of unordered pairs of strings (arr[i], arr[j]), which on concatenation contains each… Read More »

Given an array arr[] of N integers, the task is to count the pairs of indices (i, j) such that 0 ≤ i < j… Read More »

Given an array arr[] of binary strings, the task is to calculate the bitwise OR of all of these strings and print the resultant string.… Read More »

Given a NxN matrix, the task is to find the sum of bit-wise OR of all of its rectangular sub-matrices. Examples: Input : arr[][] =… Read More »

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 »

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 »

Give an array of positive integers. The task is to find the total sum after performing the bitwise OR operation on all the sub-arrays of… 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 »