The answer to the ith query is the maximum ... elements in nums are larger than mi, then the answer is -1. Return an integer array answer where answer.length == queries.length and answer[i] is the ...

The algorithm recursively divides the array into two halves until the sublists contain only one or two elements. For each division, it performs comparisons to combine the maximum and minimum values ...