3 added 41 characters in body; edited title
source | link

Count number of pairs of elements in an array whose given bitwise OR operation is equal to a given Kinteger

Given an integarinteger array. We and an integer $k$, we have to findcount the number of pairs of elements from the array whose bitwise OR operation is K$k$ in O(n)$O(n)$ time complexity. How could this be done?

Count number of pairs of elements in an array whose given bitwise OR operation is equal to given K

Given an integar array. We have to find number of pairs of elements from the array whose bitwise OR operation is K in O(n) time complexity.

Count number of pairs of elements in an array whose bitwise OR is equal to a given integer

Given an integer array and an integer $k$, we have to count the number of pairs of elements from the array whose bitwise OR is $k$ in $O(n)$ time complexity. How could this be done?

2 edited body
source | link

Given an integar array. We have to find number of pairs of elements from the array whose bitwise OR operation is K in oO(n) time complexity.

Given an integar array. We have to find number of pairs of elements from the array whose bitwise OR operation is K in o(n) time complexity.

Given an integar array. We have to find number of pairs of elements from the array whose bitwise OR operation is K in O(n) time complexity.

1
source | link

Count number of pairs of elements in an array whose given bitwise OR operation is equal to given K

Given an integar array. We have to find number of pairs of elements from the array whose bitwise OR operation is K in o(n) time complexity.