Perfect Pair : DP Bitmask

#1

Can you please provide me the editorial for this ques ?
I am unable to access it.

#2

Hey @aman2382000
There is no editorial for this problem yet sorry

If your doubt is resolved please close it

#3

Can you please tell, how to proceed with this ques ?

#4

@aman2382000
Each number A has a unique pair B which will give A&B = 0 because you need all bits not set in B to be set in A
So store elements in hashmap
then iterate elements and if counter element of A is present in hashmap then add it to count

If your query is resolved kindly close it