## Bitwise AND of the sum of prime numbers and the sum of composite numbers in an array

Given an array of positive numbers, the task is to find the bitwise AND of the sum of non-prime numbers and the sum of prime… Read More »

- Count pairs of elements such that number of set bits in their AND is B[i]
- Find letter's position in Alphabet using Bit operation
- Partition the array in K segments such that bitwise AND of individual segment sum is maximized
- Queries for bitwise AND in the index range [L, R] of the given array
- Bitwise AND of sub-array closest to K
- Total pairs in an array such that the bitwise AND, bitwise OR and bitwise XOR of LSB is 1
- Maximum Bitwise AND value of subsequence of length K
- Check whether bitwise AND of N numbers is Even or Odd
- Bitwise AND of the sum of prime numbers and the sum of composite numbers in an array
- Find smallest positive number Y such that Bitwise AND of X and Y is Zero
- Queries for bitwise AND in the given matrix
- Generate an array having Bitwise AND of the previous and the next element

Given an array of positive numbers, the task is to find the bitwise AND of the sum of non-prime numbers and the sum of prime… Read More »

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

Given an array of integers arr[] of N elements, the task is to generate another array having (Bitwise) AND of previous and next elements with… Read More »

Given an array a of size N and an integer K. The task is to find the maximum bitwise and value of elements of any… Read More »

Given an integer X. The task is to find the the smallest positive number Y(> 0) such that X AND Y is zero. Examples: Input… Read More »

Given an array of size N and an integer K. The task is to partition the array in K segments such that bitwise AND of… Read More »

Given two arrays A[] and B[] of N elements each. The task is to find the number of index pairs (i, j) such that i… Read More »

Given an N * N matrix mat[][] consisting of non-negative integers and some queries consisting of top-left and bottom-right corner of the sub-matrix, the task… Read More »

Given an array arr[] of N and Q queries consisting of a range [L, R]. the task is to find the bit-wise AND of all… Read More »

Given a string of English alphabets. The task is, for every character in the string print its position in the English alphabets. Note: The characters… Read More »

Given an integer array arr[] of size N and an integer K, the task is to find the sub-array arr[i….j] where i ≤ j and… Read More »

Given an array arr[] of size N. The task is to find the number of pairs (arr[i], arr[j]) as cntAND, cntOR and cntXOR such that:… Read More »

Given two numbers N and K. The task is to find the index of the K-th set bit in the number from the right. Note:… Read More »

Given an array of integers, the task is to find the AND of all elements of each subset of the array and print the minimum… Read More »

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