You are given an integer array nums of length $n$ and a $2$D integer array queries, where queries[i] $= [l_i, r_i]$.

The XOR score of an array is obtained by repeatedly replacing the array with a new array formed by taking the bitwise XOR of adjacent elements, continuing this process until only $1$ element remains.

For each query, determine the maximum XOR score among all subarrays of nums[l_i..r_i].

Return an array ans where ans[i] is the maximum XOR score for the $i^{ ext{th}}$ query.

Constraints:

• $1 \leq n ==$ nums.length $\leq 2000$

• $0 \leq$ nums[i] $\leq 2^{31} - 1$

• $1 \leq q ==$ queries.length $\leq 10^5$

• queries[i].length $== 2$

• queries[i] $= [l_i, r_i]$

• $0 \leq l_i \leq r_i \leq n - 1$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.