Partition Equal Subset Sum

Problem

Determine whether the array can be split into two subsets with equal sums.

Examples

Example 1

Input: [1,5,11,5]

Output: true

Example 2

Input: [1,2,3,5]

Output: false

Input and output use JSON-compatible values. For linked-list and tree questions, arrays represent the node structure as described above. Your code should implement solve(input).

Write your solutionImplement solve(input). Your draft is saved in this browser.

Compiler

How to solve Partition Equal Subset Sum

Determine whether the array can be split into two subsets with equal sums. If the overall sum is odd, equal partitioning is impossible. The reference implementation illustrates this approach; check the example and edge cases.

Time and space complexity

O(n·target) pseudo-polynomial time and O(target) space.

Practise and improve

Choose JavaScript, TypeScript or Python, complete the starter code, then select Run Tests. Request a hint when you need guidance, or choose View solution and confirm if you would like to study the reference implementation.