Google Online Assesment Question

Revision en1, by FameOfTheLegends, 2021-07-23 14:51:14

given an array with n elements, and Q queries consisting of an integer find whether there exists an element in the array such that it's bitwise and is zero

1<=n<10^5 , 1<=q<10^5.

Can anyone tell how to do this question.

Tags #google, #internship

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English FameOfTheLegends 2021-07-23 14:51:14 261 Initial revision (published)