Help In Interview Problem

Revision en1, by triggered_, 2020-12-25 16:03:16

Q.Find the number of pairs in the array whose bitwise AND is greater then K?

Size of Array: N=5*(10^5)

Elements in Array: (10^9)>=a[i]>=1

Range for K: (10^9)>=K>=0

Expected Time Complexity: O(N) or O(NlogN)

Tags #codenation, interview, bitmasking

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English triggered_ 2020-12-25 16:03:16 243 Initial revision (published)