← Prev

Partition Equal Subset Sum

Medium 1-D Dynamic Programming

Decide whether an array can be split into two subsets of equal sum.

Full statement, examples and constraints: see the original problem link below.

A full in-site walkthrough for this problem is coming soon.

Write your solution in the editor, then hit “Mark solved”. In-browser run & auto-check is coming soon.