Maximum OR value of a pair in an array
Given an array arr[] of N positive elements. The task is to find the maximum bitwise OR value of a pair from the given array.
Examples:
Input: arr[] = {4, 8, 12, 16}
Output: 28
(12, 16) is the pair with the maximum bitwise OR.
12 | 16 = 28
Input: arr[] = {4, 8, 16, 2}
Output: 24
Approach: Iterate over all the possible pairs and calculate the OR value of these pairs. Finally, print the maximum of all the values.
Below is the implementation of the above approach:
C++
// C++ implementation of the approach #include <bits/stdc++.h> using namespace std; // Function to return the maximum bitwise OR // for any pair of the given array int maxOR(int arr[], int n) { // To store the maximum OR value int maxVal = 0; // For every possible pair for (int i = 0; i < n - 1; i++) for (int j = i + 1; j < n; j++) { // Update the maximum OR value maxVal = max(maxVal, arr[i] | arr[j]); } return maxVal; } // Driver code int main() { int arr[] = { 4, 8, 12, 16 }; int n = sizeof(arr) / sizeof(arr[0]); cout << maxOR(arr, n); return 0; } |
chevron_right
filter_none
Java
// Java implementation of the approach class GFG { // Function to return the maximum bitwise OR // for any pair of the given array static int maxOR(int arr[], int n) { // To store the maximum OR value int maxVal = 0; // For every possible pair for (int i = 0; i < n - 1; i++) for (int j = i + 1; j < n; j++) { // Update the maximum OR value maxVal = Math.max(maxVal, arr[i] | arr[j]); } return maxVal; } // Driver code public static void main (String[] args) { int arr[] = { 4, 8, 12, 16 }; int n = arr.length; System.out.println(maxOR(arr, n)); } } // This code is contributed by AnkitRai01 |
chevron_right
filter_none
Python3
# Python3 implementation of the approach # Function to return the maximum bitwise OR # for any pair of the given array def maxOR(arr, n): # To store the maximum OR value maxVal = 0; # For every possible pair for i in range(n - 1): for j in range(i + 1, n): # Update the maximum OR value maxVal = max(maxVal, arr[i] | arr[j]); return maxVal; # Driver code if __name__ == '__main__': arr = [4, 8, 12, 16]; n = len(arr); print(maxOR(arr, n)); # This code is contributed by 29AjayKumar |
chevron_right
filter_none
C#
// C# implementation of the approach using System; class GFG { // Function to return the maximum bitwise OR // for any pair of the given array static int maxOR(int []arr, int n) { // To store the maximum OR value int maxVal = 0; // For every possible pair for (int i = 0; i < n - 1; i++) for (int j = i + 1; j < n; j++) { // Update the maximum OR value maxVal = Math.Max(maxVal, arr[i] | arr[j]); } return maxVal; } // Driver code static public void Main () { int []arr = { 4, 8, 12, 16 }; int n = arr.Length; Console.Write(maxOR(arr, n)); } } // This code is contributed by ajit. |
chevron_right
filter_none
Output:
28
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
Recommended Posts:
- Maximum AND value of a pair in an array
- Maximum OR value of a pair in an Array without using OR operator
- Find a pair (n,r) in an integer array such that value of nCr is maximum
- Find the maximum sum pair in an Array with even parity
- Find pair with maximum ratio in an Array
- Find a pair (n,r) in an integer array such that value of nPr is maximum
- Maximum pair sum in the given index ranges of an Array
- Probability that a random pair chosen from an array (a[i], a[j]) has the maximum sum
- Find a pair with maximum product in array of Integers
- Probability of choosing a random pair with maximum sum in an array
- Probability of a random pair being the maximum weighted pair
- Number of indices pair such that element pair sum from first Array is greater than second Array
- Pair formation such that maximum pair sum is minimized
- Find Sum of pair from two arrays with maximum sum
- Pair with given sum and maximum shortest distance from end
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
- Kth most frequent Character in a given String
- Number of ways to obtain each numbers in range [1, b+c] by adding any two numbers in range [a, b] and [b, c]
- Count of subarrays of size K which is a permutation of numbers from 1 to K
- Count of triplets of numbers 1 to N such that middle element is always largest
- Minimum LCM of all pairs in a given array
- Count of subarrays whose sum is a perfect square
- Count subarrays with sum equal to its XOR value
- Construct an Array such that cube sum of all element is a perfect square
- Minimize the maximum difference of adjacent elements after at most K insertions
- Count numbers from range whose prime factors are only 2 and 3 using Arrays | Set 2