Available question text
Given nums (n ≤ 2000) and up to 10^5 queries [l,r], for each query return the maximum "XOR score" among all contiguous subarrays of nums[l..r], where the XOR score is obtained by repeatedly replacing adjacent pairs with their XOR until one value remains. The core challenge is efficiently computing or precomputing this non‑standard fold for all O(n^2) subarrays so you can answer many range-maximum queries quickly.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3277. Maximum XOR Score Subarray Queries
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source