Find largest index till which Bitwise AND of elements is at least X for Q queries

Given array of integers arr[] and queries[] of size N and Q, the task is to find the largest index for each query Q[i] such that bitwise AND of each element from starting till that index is at least Q[ i], i.e. (arr[1] & arr[2] &. . .& arr[k] & . . & arr [k]& Q [i]). The basic idea of the approach is to iterate through the Show more