OR bit

Problem Statement

OR bit Problem Description Find the maximum value obtained by performing a bitwise OR operation on any subsequence of a given array. Complete the solve function. The function takes 2 parameters and returns an integer denoting the answer to the question: N Represents the number of elements in the array A Represents the array Input Format Note: Use this input format if you are testing against custom input or writing code in a language where we don't provide boilerplate code. The first line contains a single integer T , which denotes the number of test cases. For each test case: The first line contains an integer N , denoting the total elements in the array. The second line contains N space-separated numbers. Output Format For each test case, print the answer in a new line. Constraints 1 <= T <= 10 4 1 <= N <= 10 5 0 <= |A[i]| <= 10 9 Where |x| represents the absolute value of x. It's guaranteed that the sum of N over all test cases will not exceed 2 * 10 5 . Examples Ex