3599. Partition Array to Minimize XOR

You are given an integer array nums and an integer k. Your task is to partition nums into k non-empty subarrays. For each subarray, compute the bitwise XOR of all its elements. Return the minimum possible value of the maximum XOR among these k subarrays. Example 1: Input: nums = [1,2,3], k = 2 Output: 1 Explanation: The optimal partition is [1] and [2, 3]. - XOR of the first subarray is