mediumNeetCode 150
Equal Sum Array Partition
Also known as: Partition Equal Subset Sum
Check if array can be partitioned into two equal sum subsets Example: [1,5,11,5] => true (can split into [1,5,5] and [11])
Halve the total, then it is a subset-sum question. I track which sums are reachable in one boolean row and check the target.
Meet Coco
Coco is an AI study partner, not a person. She listens while you explain your code, asks what a line does and never hands you the fix. Sign in free to type with Coco, up to a daily limit, and to talk with her for one hour. After that, talking comes with the $79 pack. Anyone can open the editor and run their code.
1Part 1: Equal Sum Partitionmedium
Based onLeetCode