dsa1 min read
Partition to K Equal Sum Subsets — Bitmask DP
Can array be partitioned into k equal-sum subsets? Bitmask DP: dp[mask] = sum filled so far. O(2^n * n) instead of O(k^n) DFS.
Read →
Bitmask-dp
2 articles
dsa1 min read
Minimum XOR Sum of Two Arrays — Bitmask DP
Assign each element of nums1 to exactly one element of nums2 to minimize XOR sum. Classic assignment bitmask DP: dp[mask] = min XOR sum.
Read →