Skip to main content
Partition Equal Subset Sum | AlgoCracked
AlgoCracked
ProblemsPartition Equal Subset Sum
Medium46.0% acceptance
Blind75Dynamic ProgrammingArrayKnapsack

Partition Equal Subset Sum

Given an array of positive integers nums , return true if the array can be split into two subsets whose sums are equal , otherwise false . This reduces to asking whether some subset sums to exactly half of the total. Input format Input is a single array, e.g. [[1,5,11,5]] .

Loading workspace…