// Partition Equal Subset Sum — MEDIUM

// Category: dynamic-programming

Given an integer array `nums`, return `true` if you can partition the array into two subsets such that the sum of the elements in both subsets is equal, or `false` otherwise.

**Key insight:** We need to find a subset with sum equal to `total / 2`. Use 0/1 knapsack DP.

Example: nums = [1,5,11,5]

Output: true