Leetcode 3599. Partition Array to Minimize XOR

Partition the array into k non-empty contiguous subarrays so the maximum of each subarray's bitwise XOR is as small as possible; the core challenge is optimizing partitions under XOR costs (use prefix-XORs with DP or bitwise/binary-search techniques, n ≤ 250).