CPMagical CP Library

Problem solution · C++

Partition Array to Minimize Xor

Partition Array to Minimize Xor: a C++ solution using dynamic programming. Learn the idea, check the complexity, and read the full code, with credit to Kamyu LeetCode Solutions.

Technique
Dynamic programming
Source
Kamyu LeetCode Solutions
Length
58 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Dynamic programming

For Partition Array to Minimize Xor, the implementation records answers for smaller states and reuses them to build the requested result without repeating work.

  1. Define precisely what one DP state represents.
  2. Establish the base cases before transitions are evaluated.
  3. Process states in dependency order and combine only already-known values.

Code notes

  • 58 lines of C++ from the credited upstream file partition-array-to-minimize-xor.cpp.
  • The implementation visibly relies on sequence storage, cached states.
  • 8 loop blocks detected.

Complexity

Multiply the number of reachable states by the work performed for each transition, then include the stored state table in memory usage.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from Kamyu LeetCode Solutions by kamyu104 and is used under the MIT licence.

Open problem ↗Original source ↗
Full codePartition Array to Minimize Xor · C++C++
Use this to learn the idea, then write your own version.
// Time:  O(n^2 * k)// Space: O(n) // dp, prefix sumclass Solution {public:    int minXor(vector<int>& nums, int k) {        static const int INF = numeric_limits<int>::max();         vector<int> prefix(size(nums) + 1);        for (int i = 0; i < size(nums); ++i) {            prefix[i + 1] = prefix[i] ^ nums[i];        }        vector<int> dp(prefix);        dp[0] = INF;        for (int l = 2; l <= k; ++l){            for (int i = size(nums); i >= l - 1; --i) {                int mn = INF;                for (int j = l - 1; j < i; ++j) {                    const auto& v = prefix[i] ^ prefix[j];                    const auto& mx = dp[j] > v ? dp[j] : v;                    if (mx < mn) {                        mn = mx;                    }                }                dp[i] = mn;            }        }        return dp[size(nums)];    }}; // Time:  O(n^2 * k)// Space: O(n)// dp, prefix sumclass Solution2 {public:    int minXor(vector<int>& nums, int k) {        static const int INF = numeric_limits<int>::max();         vector<int> prefix(size(nums) + 1);        for (int i = 0; i < size(nums); ++i) {            prefix[i + 1] = prefix[i] ^ nums[i];        }        vector<int> dp(size(nums) + 1, INF);        dp[0] = 0;        for (int l = 1; l <= k; ++l){            for (int i = size(nums); i >= l - 1; --i) {                dp[i] = INF;                for (int j = l - 1; j < i; ++j) {                    dp[i] = min(dp[i], max(dp[j], prefix[i] ^ prefix[j]));                }            }        }        return dp[size(nums)];    }};

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗