Check whether bitwise AND of a number with any subset of an array is zero or not

03 Mar, 2022
Given an array and a Number N. The task is to check whether there exists any subset of this array such that the bitwise AND of this subset with N is zero.Examples:  
Input : arr[] = {1, 2, 4}  ;  N = 3
Output : YES
Explanation: The subsets are:
(1, 2 ), (1, 4), (1, 2, 4) 

Input : arr[] = {1, 1, 1}  ;  N = 3
Output : NO
 
A Simple Approach is to find the bitwise-AND of all the subsets of the array and check whether the AND of N with any subset is zero or not.An Efficient Approach is to observe that bitwise-AND of any two numbers will always produce a number less than or equal to the smaller number. So our task is to find the subset which has the minimum value of bitwise AND. So as stated earlier the AND of any two numbers will always produce a number less than or equal to the minimum number so the minimum value of AND will be the AND of all the array elements. So the task now reduces to check the bitwise-AND of all the array elements and N and if it is zero we will print YES otherwise NO.Below is the implementation of the above approach:  
C++
Java
Python 3
C#
PHP
Javascript
// C++ program to check whether bitwise AND of a number// with any subset of an array is zero or not#include <bits/stdc++.h>using namespace std; // Function to check whether bitwise AND of a number// with any subset of an array is zero or notvoid isSubsetAndZero(int array[], int length, int N){    // variable to store the    // AND of all the elements    int arrAnd = array[0];     // find the AND of all the elements    // of the array    for (int i = 1; i < length; i++) {        arrAnd = arrAnd & array[i];    }     // if the AND of all the array elements    // and N is equal to zero    if ((arrAnd & N) == 0)        cout << "YES" << endl;    else        cout << "NO" << endl;} // Driver Codeint main(){    int array[] = { 1, 2, 4 };    int length = sizeof(array) / sizeof(int);     int N = 3;     isSubsetAndZero(array, length, N);}
// Java program to check whether bitwise AND of a number// with any subset of an array is zero or notimport java.io.*; public class GFG {  // Function to check whether bitwise AND of a number// with any subset of an array is zero or notstatic void isSubsetAndZero(int array[], int length, int N){    // variable to store the    // AND of all the elements    int arrAnd = array[0];     // find the AND of all the elements    // of the array    for (int i = 1; i < length; i++) {        arrAnd = arrAnd & array[i];    }     // if the AND of all the array elements    // and N is equal to zero    if ((arrAnd & N) == 0)        System.out.println( "YES");    else        System.out.println( "NO");} // Driver Code    public static void main (String[] args) {        int array[] = { 1, 2, 4 };    int length = array.length;     int N = 3;     isSubsetAndZero(array, length, N);    }}//This code is contributed by shs..
# Python 3 program to check whether# bitwise AND of a number with any# subset of an array is zero or not # Function to check whether bitwise# AND of a number with any subset# of an array is zero or notdef isSubsetAndZero(array, length, N):     # variable to store the    # AND of all the elements    arrAnd = array[0]     # find the AND of all    # the elements of the array    for i in range(1, length) :        arrAnd = arrAnd & array[i]     # if the AND of all the array    # elements and N is equal to zero    if ((arrAnd & N) == 0):        print("YES")    else:        print("NO") # Driver Codeif __name__ == "__main__":    array = [ 1, 2, 4 ]    length = len(array)     N = 3     isSubsetAndZero(array, length, N) # This code is contributed# by ChitraNayal
// C# program to check whether// bitwise AND of a number with// any subset of an array is zero or notusing System; class GFG{ // Function to check whether bitwise// AND of a number with any subset// of an array is zero or notstatic void isSubsetAndZero(int []array,                            int length, int N){    // variable to store the    // AND of all the elements    int arrAnd = array[0];     // find the AND of all the    // elements of the array    for (int i = 1; i < length; i++)    {        arrAnd = arrAnd & array[i];    }     // if the AND of all the array    // elements and N is equal to zero    if ((arrAnd & N) == 0)        Console.WriteLine( "YES");    else        Console.WriteLine( "NO");} // Driver Codepublic static void Main (){    int []array = { 1, 2, 4 };    int length = array.Length;         int N = 3;         isSubsetAndZero(array, length, N);}} // This code is contributed// by inder_verma
<?php// PHP program to check whether// bitwise AND of a number with// any subset of an array is zero or not // Function to check whether// bitwise AND of a number with// any subset of an array is zero or notfunction isSubsetAndZero($array, $length, $N){    // variable to store the    // AND of all the elements    $arrAnd = $array[0];     // find the AND of all the    // elements of the array    for ($i = 1; $i <$length; $i++)    {        $arrAnd = $arrAnd & $array[$i];    }     // if the AND of all the array    // elements and N is equal to zero    if (($arrAnd & $N) == 0)        echo("YES");    else        echo("NO");} // Driver Code$array = array( 1, 2, 4 );$length = count($array); $N = 3; isSubsetAndZero($array, $length, $N); // This code is contributed// by Shashank?>
<script> // Javascript implementation of the above approach  // Function to check whether bitwise AND of a number// with any subset of an array is zero or notfunction isSubsetAndZero(array, len, N){    // variable to store the    // AND of all the elements    var arrAnd = array[0];     // find the AND of all the elements    // of the array    for (var i = 1; i < len; i++) {        arrAnd = arrAnd & array[i];    }     // if the AND of all the array elements    // and N is equal to zero    if ((arrAnd & N) == 0)        document.write("YES"+"<br>");    else        document.write("NO"+"<br>");}   var array = [1, 2, 4 ];var len = array.length;var N = 3;isSubsetAndZero(array, len, N); // This code is contributed by SoumikMondal </script>
YES
 
Shashank12
inderDuMCA
ukasp
SoumikMondal
surinderdawra388
Bitwise-AND
subset
Bit Magic
Competitive Programming
Bit Magic
subset
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.
Program to find whether a given number is power of 2
Little and Big Endian Mystery
Binary representation of a given number
Josephus problem | Set 1 (A O(n) Solution)
Divide two integers without using multiplication, division and mod operator
Competitive Programming - A Complete Guide
Practice for cracking any coding interview
Arrow operator -> in C/C++ with Examples
Modulo 10^9+7 (1000000007)
Prefix Sum Array - Implementation and Applications in Competitive Programming