3277. Maximum XOR Score Subarray Queries

You are given an array nums of n integers, and a 2D integer array queries of size q, where queries[i] = [li, ri]. For each query, you must find the maximum XOR score of any subarray of nums[li..ri]. The XOR score of an array a is found by repeatedly applying the following operations on a so that only one element remains, that is the score: - Simultaneously replace a[i] with a[i] XOR a[i + 1] fo