Three things to remember from this problem:
Partition problems often hide subset sum. If you need two groups with some property, check if one group having that property implies the other does too.
Boolean DP uses OR instead of max/min. The formula is simpler than value improvement.
Early exit conditions matter. Checking if the sum is odd saves you from running unnecessary DP.