Google | Coding Round (GOCC) | 17th June 2021

Summary 2 problems, 1 hour Almost all languages allowed Problem 1 You are given an array keys of N elements. Then there will be Q queries and in each query you will be given an Integer X. You have to answer for each query in "Yes" or "No". It will be "Yes" if you can find any element in keys such that its bitwise and with X equals 0 i.e (keys[i]&X;) == 0 is satisfied else it will be "No". ...