Given two positive integers N and K, the task is to find the number of arrays of size N such that each array element lies… Read More

# Tag Archives: Bitwise-AND

Given a positive integer N, the task is to print the minimum count of consecutive numbers less than N such that the bitwise AND of… Read More

Given a positive integer N, the task is to count the number of N-digit numbers such that the bitwise AND of adjacent digits equals 0.… Read More

Given two arrays arr[] of size N and queries[] of size Q, the task is to find the OR of AND of subsets of the… Read More

Given an integer N, the task is to find the smallest number K such that bitwise AND of all the numbers in range [N, N-K]… Read More

Given two positive integers A and B, the task is to calculate the minimum number of operations required such that Bitwise OR of A and… Read More

Given two arrays A and B of sizes N and M respectively, the task is to calculate the XOR sum of bitwise ANDs of all… Read More

Given an array arr[] consisting of N positive integers, the task is to find the sum of Bitwise AND of all possible triplets (arr[i], arr[j],… Read More

Given a positive integer N, the task is to count all numbers which are less than N and Bitwise AND of all such numbers with… Read More

Given an array arr[] consisting of N integers, the task is to find the maximum sum of any subsequence from the array having Bitwise AND… Read More

Given two arrays A[] and B[] of sizes N, the task is to find the maximum sum of Bitwise AND of same-indexed elements in the… Read More

Given two arrays arr1[] and arr2[] consisting of N and M integers respectively, the task is to print the Bitwise XOR of Bitwise AND of… Read More

Given an array arr[] consisting of N integers and integer K, the task is to find the smallest integer X with exactly K set bits… Read More

Given a square symmetric matrix mat[][] of size N, the task is to find the minimum sum possible of an array arr[] of size N,… Read More