Partition Equal Subset Sum — C# Coding Problem
Difficulty: medium | Category: dynamic-programming
Problem Description
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.
Examples
Example 1
Input: nums = [1,5,11,5]
Output: true
Explanation: Can partition into [1, 5, 5] and [11].
Example 2
Input: nums = [1,2,3,5]
Output: false