Equal Partition Array Solution

Problem Statement

Given a non-empty array of integers, determine if it is possible to partition the array into two groups with equal sum.

Constraints

• The input array is non-empty and contains only integers.
• The sum of all elements in the array is even.
• If the sum of all elements is zero, the array can be partitioned into two groups with equal sum (each group containing all elements).
• Otherwise, each group should contain at least one element.
• The array can be partitioned into two groups with equal sum even if some elements appear multiple times.

More Arrays Problems