Well played Unacademy by making Codechef Pro. Who is waiting for Codeforces Pro after Codechef Pro? Just Kidding Guys.

Problem link I did not find any better solution in the discuss section of leetcode that's why posting here.

1 — link of the first problem 2 — link of second problem thanks in advance.

Given an array A of N elements, you can pick at most one element of the array and increment or decrement it by any value. The task is to maximize the AND of the resulting array.

Note: AND of the array is defined as the bitwise AND(&) of all the array elements.

Constraints: 2 ≤ N ≤ 2 * 10^5 0 ≤ A[i] ≤ 2 * 10^9