Partition array into two subsets with equal sum

Approach

• If total sum odd, impossible.
• Subset sum DP: can we reach target = sum/2?

Java Solution

public boolean canPartition(int[] nums) {
    int sum = 0;
    for (in…