FPEvalRepoPublic/LeetCodeMetaData

1{2  "id": 3551,3  "name": "maximum-xor-score-subarray-queries",4  "difficulty": "Hard",5  "link": "https://leetcode.com/problems/maximum-xor-score-subarray-queries/",6  "date": "2024-08-25",7  "task_description": "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]` for all indices `i` except the last one. Remove the last element of `a`. Return an array `answer` of size `q` where `answer[i]` is the answer to query `i`. **Example 1:** **Input:** nums = [2,8,4,32,16,1], queries = [[0,2],[1,4],[0,5]] **Output:** [12,60,60] **Explanation:** In the first query, `nums[0..2]` has 6 subarrays `[2]`, `[8]`, `[4]`, `[2, 8]`, `[8, 4]`, and `[2, 8, 4]` each with a respective XOR score of 2, 8, 4, 10, 12, and 6. The answer for the query is 12, the largest of all XOR scores. In the second query, the subarray of `nums[1..4]` with the largest XOR score is `nums[1..4]` with a score of 60. In the third query, the subarray of `nums[0..5]` with the largest XOR score is `nums[1..4]` with a score of 60. **Example 2:** **Input:** nums = [0,7,3,2,8,5,1], queries = [[0,3],[1,5],[2,4],[2,6],[5,6]] **Output:** [7,14,11,14,5] **Explanation:** Index nums[li..ri] Maximum XOR Score Subarray Maximum Subarray XOR Score 0 [0, 7, 3, 2] [7] 7 1 [7, 3, 2, 8, 5] [7, 3, 2, 8] 14 2 [3, 2, 8] [3, 2, 8] 11 3 [3, 2, 8, 5, 1] [2, 8, 5, 1] 14 4 [5, 1] [5] 5 **Constraints:** `1 <= n == nums.length <= 2000` `0 <= nums[i] <= 231 - 1` `1 <= q == queries.length <= 105` `queries[i].length == 2 ` `queries[i] = [li, ri]` `0 <= li <= ri <= n - 1`",8  "test_case": [9    {10      "label": "Example 1",11      "input": "nums = [2,8,4,32,16,1], queries = [[0,2],[1,4],[0,5]]",12      "output": "[12,60,60] "13    },14    {15      "label": "Example 2",16      "input": "nums = [0,7,3,2,8,5,1], queries = [[0,3],[1,5],[2,4],[2,6],[5,6]]",17      "output": "[7,14,11,14,5] "18    }19  ],20  "constraints": [21    "Simultaneously replace a[i] with a[i] XOR a[i + 1] for all indices i except the last one.",22    "Remove the last element of a.",23    "1 <= n == nums.length <= 2000",24    "0 <= nums[i] <= 231 - 1",25    "1 <= q == queries.length <= 105",26    "queries[i].length == 2",27    "queries[i] = [li, ri]",28    "0 <= li <= ri <= n - 1"29  ],30  "python_template": "class Solution(object):\n    def maximumSubarrayXor(self, nums, queries):\n        \"\"\"\n        :type nums: List[int]\n        :type queries: List[List[int]]\n        :rtype: List[int]\n        \"\"\"\n        ",31  "java_template": "class Solution {\n    public int[] maximumSubarrayXor(int[] nums, int[][] queries) {\n        \n    }\n}",32  "metadata": {33    "func_name": "maximumSubarrayXor"34  }35}