Question 1 -

Question 2-

Given an array and an integer X, find if the array can be made strictly decreasing by adding or subtracting X from any element of the array. You can add or substract from each elemet only once.

Question 3-

Given an array arr and a number X, find number of pairs (i,j) in array which satisfy the condition (arr[i] ^ arr[j]) & X = 0 .