Leetcode 416. Partition Equal Subset Sum
Determine whether the array can be partitioned into two subsets with equal sum — equivalently, check if there exists a subset that sums to half the total. This is a classic 0/1 subset-sum / knapsack problem solvable with DP or bitset techniques since total sum ≤ 200*100.
Asked at:
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Late December, 2024
Mid-level
Partition Equal Subset Sum Modification
Hello Interview Premium
Your account is free and you can post anonymously if you choose.